3428 search results - page 537 / 686 » Making the Case |
195
click to vote
COMPGEOM
2006
ACM
16 years 14 days ago
2006
ACM
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...
172
click to vote
SPAA
2004
ACM
15 years 12 months ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
200
click to vote
DC
1999
15 years 6 months ago
1999
or fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus can serve as a basic building blo...
175
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
This paper presents a probing-based method for probabilistic localization in automated robotic assembly. We consider peg-in-hole problems in which a needle-like peg has a single p...
177
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
This paper is concerned with decentralized estimation of a Gaussian source using multiple sensors. We consider a diversity scheme where only the sensor with the best channel sends...