6568 search results - page 342 / 1314 » Reducing the Complexity of Reductions |
200
click to vote
PODC
2006
ACM
16 years 26 days ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
188
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
258
click to vote
HPCA
2004
IEEE
16 years 7 months ago
2004
IEEE
Recent research suggests that there are large variations in a cache's spatial usage, both within and across programs. Unfortunately, conventional caches typically employ fixe...
209
click to vote
DAM
1999
15 years 6 months ago
1999
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
231
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...