350 search results - page 28 / 70 » Lower and upper bounds on obtaining history independence |
110
click to vote
COMPGEOM
2006
ACM
15 years 1 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 ...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We study the capacity of secret-key agreement over a wiretap channel with state parameters. The transmitter communicates to the legitimate receiver and the eavesdropper over a disc...
120
click to vote
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
ICCAD
1997
IEEE
15 years 4 months ago
1997
IEEE
A power estimation approach is presented in which blocks of consecutive vectors are selected at random from a user-supplied realistic input vector set and the circuit is simulated...
LOGCOM
2002
14 years 11 months ago
2002
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...