1434 search results - page 158 / 287 » Distributed Computing with Imperfect Randomness |
142
click to vote
SIGMOD
1998
ACM
15 years 10 months ago
1998
ACM
We present new algorithms for computing approximate quantiles of large datasets in a single pass. The approximation guarantees are explicit, and apply without regard to the value ...
162
click to vote
CIARP
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
164
click to vote
AAAI
2007
15 years 8 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
149
click to vote
NIPS
1998
15 years 7 months ago
1998
Principal curves have been defined as "self consistent" smooth curves which pass through the "middle" of a d-dimensional probability distribution or data cloud...
177
click to vote
IWCMC
2006
ACM
16 years 9 days ago
2006
ACM
Grid-based sensor deployment is an effective and efficient practice for provisioning wireless sensor networks. Previous work has addressed grid-based deployment of sensors in orde...