Sciweavers

5580 search results - page 222 / 1116
» Randomized priority algorithms
Sort
View
PDP
2006
IEEE
15 years 8 months ago
A Distributed Query Structure to Explore Random Mappings in Parallel
We explore the possibilities to organize a query data structure in the main memories or hard disks of a cluster computer. The query data structure serves to improve the performanc...
Jan Heichler, Jorg Keller
COLCOM
2005
IEEE
15 years 8 months ago
SLACER: randomness to cooperation in peer-to-peer networks
Peer-to-peer applications can benefit from human friendship networks (e.g., e-mail contacts or instant message buddy lists). However these are not always available. We propose an...
David Hales, Stefano Arteconi, Özalp Babaoglu
ISIPTA
2003
IEEE
140views Mathematics» more  ISIPTA 2003»
15 years 7 months ago
A Second-Order Uncertainty Model of Independent Random Variables: An Example of the Stress-Strength Reliability
A second-order hierarchical uncertainty model of a system of independent random variables is studied in the paper. It is shown that the complex nonlinear optimization problem for ...
Lev V. Utkin
ICASSP
2010
IEEE
15 years 2 months ago
Bridge detection and robust geodesics estimation via random walks
We propose an algorithm for detecting bridges and estimating geodesic distances from a set of noisy samples of an underlying manifold. Finding geodesics on a nearest neighbors gra...
Eugene Brevdo, Peter J. Ramadge
SIGIR
2008
ACM
15 years 2 months ago
Modeling expert finding as an absorbing random walk
We introduce a novel approach to expert finding based on multi-step relevance propagation from documents to related candidates. Relevance propagation is modeled with an absorbing ...
Pavel Serdyukov, Henning Rode, Djoerd Hiemstra