Sciweavers

2434 search results - page 87 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
ICASSP
2010
IEEE
15 years 3 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
109
Voted
SIGIR
2008
ACM
15 years 3 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
120
Voted
SIGMOD
1999
ACM
87views Database» more  SIGMOD 1999»
15 years 7 months ago
On Random Sampling over Joins
A major bottleneck in implementing sampling as a primitive relational operation is the ine ciency ofsampling the output of a query. It is not even known whether it is possible to ...
Surajit Chaudhuri, Rajeev Motwani, Vivek R. Narasa...
168
Voted
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
15 years 3 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
120
Voted
COLT
2006
Springer
15 years 7 months ago
Continuous Experts and the Binning Algorithm
Abstract. We consider the design of online master algorithms for combining the predictions from a set of experts where the absolute loss of the master is to be close to the absolut...
Jacob Abernethy, John Langford, Manfred K. Warmuth