5153 search results - page 498 / 1031 » Introduction to Randomized Algorithms |
145
Voted
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 ...
177
click to vote
VLDB
1994
ACM
15 years 10 months ago
1994
ACM
Spatial data mining is the discovery of interesting relationships and characteristics that may exist implicitly in spatial databases. In this paper, we explore whether clustering ...
169
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
With the emerging process variations in fabrication, the traditional corner-based timing optimization techniques become prohibitive. Buffer insertion is a very useful technique fo...
195
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
175
click to vote
EUC
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we propose a hierarchical architecture for grouping peers into clusters in a large-scale BitTorrent-like underlying overlay network in such a way that clusters are e...