248 search results - page 44 / 50 » A Simple Optimal Randomized Algorithm for Sorting on the PDM |
112
Voted
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
141
click to vote
ECAL
1995
Springer
15 years 6 months ago
1995
Springer
After an outline of the history of evolutionary algorithms, a new ( ) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it i...
133
click to vote
IOPADS
1997
15 years 3 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
113
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
109
Voted
ICASSP
2008
IEEE
15 years 8 months ago
2008
IEEE
We propose a simple and energy efficient distributed Change Detection scheme for sensor networks based on Page’s parametric CUSUM algorithm. The sensor observations are IID ove...