Sciweavers

447 search results - page 24 / 90
» Re-ranking search results using document-passage graphs
Sort
View
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 6 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
HPCC
2005
Springer
14 years 8 days ago
A Loop-Aware Search Strategy for Automated Performance Analysis
Abstract. Automated online search is a powerful technique for performance diagnosis. Such a search can change the types of experiments it performs while the program is running, mak...
Eli D. Collins, Barton P. Miller
CORR
2012
Springer
272views Education» more  CORR 2012»
12 years 2 months ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...
AH
2004
Springer
14 years 5 days ago
Using SiteRank for Decentralized Computation of Web Document Ranking
Abstract. The PageRank algorithm demonstrates the significance of the computation of document ranking of general importance or authority in Web information retrieval. However, doi...
Jie Wu, Karl Aberer
CIMCA
2005
IEEE
14 years 11 days ago
A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
Maolin Tang, Raymond Y. K. Lau