6365 search results - page 870 / 1273 » Fast Local Computation Algorithms |
222
click to vote
PODC
2006
ACM
16 years 1 months 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...
166
Voted
DSN
2000
IEEE
15 years 12 months ago
2000
IEEE
ÐWe study the quality of service (QoS) of failure detectors. By QoS, we mean a specification that quantifies 1) how fast the failure detector detects actual failures and 2) how we...
227
click to vote
EUROGRAPHICS
2010
Eurographics
15 years 8 months ago
2010
Eurographics
This paper proposes two variants of a simple but efficient algorithm for structure-preserving halftoning. Our algorithm extends Floyd-Steinberg error diffusion; the goal of our ex...
287
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Central to many problems in scene understanding based on using a network of tens, hundreds or even thousands of randomly distributed cameras with on-board processing and wireless c...
221
Voted
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRFs o...