2168 search results - page 119 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
136
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
178
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
171
click to vote
JPDC
2006
15 years 3 months ago
2006
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
137
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: The Sulston score is a well-established, though approximate metric for probabilistically evaluating postulated clone overlaps in DNA fingerprint mapping. It is known t...
138
click to vote
MIDDLEWARE
2005
Springer
15 years 9 months ago
2005
Springer
The vision of pervasive or ubiquitous computing, conceived by Mark Weiser, foresees a world where computing is embedded in every day objects. Such objects interact with each other...