2079 search results - page 304 / 416 » Universality of random graphs |
141
click to vote
COMPGEOM
1992
ACM
15 years 8 months ago
1992
ACM
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
142
click to vote
EUROCRYPT
1990
Springer
15 years 8 months ago
1990
Springer
We describe results from an apparatus and protocol designed to implement quantum key distribution, by which two users, who share no secret information initially: 1) exchange a ran...
168
click to vote
COLT
2008
Springer
15 years 6 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
140
click to vote
SODA
2008
ACM
15 years 5 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 ...
133
click to vote
ASE
2010
15 years 4 months ago
2010
There exists a large and growing number of proposed estimation methods but little conclusive evidence ranking one method over another. Prior effort estimation studies suffered fro...