5606 search results - page 851 / 1122 » Randomization Techniques for Graphs. |
172
click to vote
RECOMB
2007
Springer
16 years 7 months ago
2007
Springer
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
173
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
218
Voted
ICCD
2005
IEEE
16 years 3 months ago
2005
IEEE
Increasingly significant power/ground supply voltage degradation in nanometer VLSI designs leads to system performance degradation and even malfunction. Existing techniques focus...
161
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
Multiport memories are extensively used in modern system designs because of the performance advantages they offer. The increased memory access throughput could lead to significan...
176
click to vote
ICCAD
2001
IEEE
16 years 3 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...