Sciweavers

5153 search results - page 179 / 1031
» Introduction to Randomized Algorithms
Sort
View
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
ALGORITHMICA
1998
111views more  ALGORITHMICA 1998»
15 years 2 months ago
A Note on Point Location in Delaunay Triangulations of Random Points
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
Luc Devroye, Ernst P. Mücke, Binhai Zhu
CN
1999
73views more  CN 1999»
15 years 2 months ago
Measuring Index Quality Using Random Walks on the Web
Recent researchhas studied howto measurethe size of a searchengine, in terms of the number of pages indexed. In this paper, we consider a di erent measure for search engines, name...
Monika Rauch Henzinger, Allan Heydon, Michael Mitz...
COMBINATORICA
2008
123views more  COMBINATORICA 2008»
15 years 1 months ago
Counting canonical partitions in the random graph
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
Jean A. Larson
JCDL
2009
ACM
179views Education» more  JCDL 2009»
15 years 9 months ago
Disambiguating authors in academic publications using random forests
Users of digital libraries usually want to know the exact author or authors of an article. But different authors may share the same names, either as full names or as initials and...
Pucktada Treeratpituk, C. Lee Giles