10608 search results - page 306 / 2122 » Complexity of O'Hara's Algorithm |
91
Voted
ALGORITHMICA
2000
15 years 15 days ago
2000
We describe a programmable apparatus that uses a vibrating surface for sensorless, nonprehensile manipulation, where parts are systematically positioned and oriented without sensor...
TCS
1998
15 years 9 days ago
1998
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
123
Voted
COMSUR
2011
14 years 14 days ago
2011
Interference is an unavoidable property of the wireless communication medium and, in sensor networks, such interference is exacerbated due to the energy-starved nature of the netw...
76
Voted
ICRA
2008
IEEE
15 years 7 months ago
2008
IEEE
— This paper presents a new updating algorithm to reduce the complexity of computing an observability index for kinematic calibration of robots. An active calibration algorithm i...
99
Voted
AAIM
2007
Springer
15 years 6 months ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...