5153 search results - page 261 / 1031 » Introduction to Randomized Algorithms |
138
Voted
ESA
1997
Springer
15 years 7 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
132
Voted
INFOCOM
2000
IEEE
15 years 8 months ago
2000
IEEE
—Efficient server selection algorithms reduce retrieval time for objects replicated on different servers and are an important component of Internet cache architectures. This pap...
117
Voted
WAOA
2007
Springer
15 years 9 months ago
2007
Springer
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
119
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
129
Voted
ICPR
2010
IEEE
15 years 9 months ago
2010
IEEE
—This paper proposes the sequential context inference (SCI) algorithm for Markov random field (MRF) image analysis. This algorithm is designed primarily for fast inference on an...