Sciweavers

5580 search results - page 223 / 1116
» Randomized priority algorithms
Sort
View
ALGORITHMICA
1998
111views more  ALGORITHMICA 1998»
15 years 4 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
125
Voted
CN
1999
73views more  CN 1999»
15 years 4 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...
128
Voted
COMBINATORICA
2008
123views more  COMBINATORICA 2008»
15 years 3 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 11 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
156
Voted
AAAI
2008
15 years 7 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang