1538 search results - page 178 / 308 » Spectral Techniques in Graph Algorithms |
128
click to vote
CIKM
2005
Springer
15 years 9 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
149
click to vote
ISPD
2010
ACM
15 years 10 months ago
2010
ACM
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
163
click to vote
TACAS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We propose a static analysis framework for concurrent programs based on reduction of thread interleavings using sound invariants on the top of partial order techniques. S...
136
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
116
click to vote
PLDI
2006
ACM
15 years 9 months ago
2006
ACM
Dependence graphs and memoization can be used to efficiently update the output of a program as the input changes dynamically. Recent work has studied techniques for combining the...