2924 search results - page 447 / 585 » Lower Bounds in Distributed Computing |
179
click to vote
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
142
Voted
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
131
Voted
SIAMCOMP
2000
15 years 4 months ago
2000
We study the problem of computing the free space F of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body....
189
Voted
TASE
2010
IEEE
14 years 11 months 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...
145
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...