614 search results - page 84 / 123 » Local Computation: Lower and Upper Bounds |
192
click to vote
COMGEO
2011
ACM
15 years 1 months ago
2011
ACM
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
180
click to vote
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
212
click to vote
TASE
2010
IEEE
15 years 25 days ago
2010
IEEE
This paper presents a robust calibration procedure for clustered wireless sensor networks. Accurate calibration of between-node distances is one crucial step in localizing sensor n...
167
click to vote
CVPR
2003
IEEE
15 years 11 months ago
2003
IEEE
A “graphics for vision” approach is proposed to address the problem of reconstruction from a large and imperfect data set: reconstruction on demand by tensor voting, or ROD-TV...
175
click to vote
PODC
2006
ACM
16 years 2 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...