10988 search results - page 385 / 2198 » Algorithmic Folding Complexity |
145
click to vote
TCS
1998
15 years 4 months 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...
163
click to vote
COMSUR
2011
14 years 4 months 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...
120
click to vote
ICRA
2008
IEEE
15 years 11 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...
140
Voted
AAIM
2007
Springer
15 years 11 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...
131
Voted
ASPDAC
1998
ACM
15 years 9 months ago
1998
ACM
−This paper describes a new redundant fault identification algorithm with Exclusive-OR circuit reduction. The experimental results using this algorithm with a FAN-based test patt...