Sciweavers

2463 search results - page 76 / 493
» Rankings of Directed Graphs
Sort
View
APWEB
2009
Springer
15 years 3 months ago
Effective Top-k Keyword Search in Relational Databases Considering Query Semantics
Keyword search in relational databases has recently emerged as a new research topic. As a search result is often assembled from multiple relational tables, existing IR-style rankin...
Yanwei Xu, Yoshiharu Ishikawa, Jihong Guan
ESA
2010
Springer
203views Algorithms» more  ESA 2010»
15 years 29 days ago
Testing Euclidean Spanners
In this paper we develop a property testing algorithm for the problem of testing whether a directed geometric graph with bounded (out)degree is a (1 + )-spanner.
Frank Hellweg, Melanie Schmidt, Christian Sohler
WWW
2003
ACM
16 years 16 days ago
Extrapolation methods for accelerating PageRank computations
We present a novel algorithm for the fast computation of PageRank, a hyperlink-based estimate of the "importance" of Web pages. The original PageRank algorithm uses the ...
Sepandar D. Kamvar, Taher H. Haveliwala, Christoph...
ICPADS
2005
IEEE
15 years 5 months ago
An Efficient Partition-Based Parallel PageRank Algorithm
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
Bundit Manaskasemsak, Arnon Rungsawang
SIGIR
2011
ACM
14 years 2 months ago
Pseudo test collections for learning web search ranking functions
Test collections are the primary drivers of progress in information retrieval. They provide a yardstick for assessing the effectiveness of ranking functions in an automatic, rapi...
Nima Asadi, Donald Metzler, Tamer Elsayed, Jimmy L...