2252 search results - page 84 / 451 » Lower Bounds for Dynamic Algorithms |
126
Voted
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
107
click to vote
ISLPED
1998
ACM
15 years 5 months ago
1998
ACM
- The objective of this paper is to provide lower and upper bounds for the switching activity on the state lines in Finite State Machines (FSMs). Using a Markov chain model for the...
127
click to vote
STOC
2007
ACM
16 years 1 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
100
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
ECAI
2006
Springer
15 years 5 months ago
2006
Springer
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...