1132 search results - page 99 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
158
click to vote
WDAG
2007
Springer
16 years 15 days ago
2007
Springer
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
182
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
172
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
182
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we derive a precise expression of spatial degrees of freedom (DOF) for two mutually interfering broadcast channels (IFBC) as a function of arbitrary numbers of t...
191
click to vote
COMPGEOM
2006
ACM
15 years 8 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 ...