1541 search results - page 145 / 309 » Analysis of Random Noise and Random Walk Algorithms |
124
click to vote
DSN
2008
IEEE
15 years 9 months ago
2008
IEEE
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their int...
143
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
125
click to vote
WWW
2002
ACM
16 years 4 months ago
2002
ACM
The Web graph is a giant social network whose properties have been measured and modeled extensively in recent years. Most such studies concentrate on the graph structure alone, an...
192
click to vote
ICIP
2008
IEEE
15 years 9 months ago
2008
IEEE
In previous work, we developed the Illum-PF-MT, which is the PFMT idea applied to the problem of tracking temporally and spatially varying illumination change. In many practical p...
125
Voted
CIKM
2007
Springer
15 years 9 months ago
2007
Springer
Dictionary-based approaches to query translation have been widely used in Cross-Language Information Retrieval (CLIR) experiments. Using these approaches, translation has been not...