Sciweavers

4972 search results - page 23 / 995
» Ranking on graph data
Sort
View
AINA
2004
IEEE
15 years 3 months ago
Parallel PageRank Computation on a Gigabit PC Cluster
Efficient computing the PageRank scores for a large web graph is actually one of the hot issues in Web-IR community. Recent researches propose to accelerate the computation, both ...
Bundit Manaskasemsak, Arnon Rungsawang
WAW
2007
Springer
77views Algorithms» more  WAW 2007»
15 years 5 months ago
Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
Sreenivas Gollapudi, Marc Najork, Rina Panigrahy
COMPGEOM
2011
ACM
14 years 3 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
COMBINATORICS
2000
71views more  COMBINATORICS 2000»
14 years 11 months ago
Low Rank Co-Diagonal Matrices and Ramsey Graphs
We examine n
Vince Grolmusz
CVPR
2009
IEEE
15 years 3 months ago
Imbalanced RankBoost for efficiently ranking large-scale image/video collections
Ranking large scale image and video collections usually expects higher accuracy on top ranked data, while tolerates lower accuracy on bottom ranked ones. In view of this, we propo...
Michele Merler, Rong Yan, John R. Smith