2084 search results - page 325 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
SPAA
2003
ACM
15 years 3 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...
ADMA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
CVPR
2010
IEEE
15 years 3 months ago
2010
IEEE
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
TAPSOFT
1995
Springer
15 years 1 months ago
1995
Springer
The Pentium computer chip’s division algorithm relies on a table from which five entries were inadvertently omitted, with the result that 1738 single precision dividenddivisor ...