Sciweavers

2018 search results - page 108 / 404
» Magnitude-preserving ranking algorithms
Sort
View
CIKM
2008
Springer
15 years 8 months ago
A random walk on the red carpet: rating movies with user reviews and pagerank
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
Derry Tanti Wijaya, Stéphane Bressan
WWW
2006
ACM
16 years 7 months ago
A pruning-based approach for supporting Top-K join queries
An important issue arising from large scale data integration is how to efficiently select the top-K ranking answers from multiple sources while minimizing the transmission cost. T...
Jie Liu, Liang Feng, Yunpeng Xing
SIGMOD
2009
ACM
189views Database» more  SIGMOD 2009»
16 years 6 months ago
Generic and effective semi-structured keyword search
Current semi-structured keyword search and natural language query processing systems use ad hoc approaches to take advantage of structural information. Although intuitive, they ar...
Arash Termehchy, Marianne Winslett
NAACL
2010
15 years 4 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
SIGIR
2011
ACM
14 years 9 months ago
Time-based query performance predictors
Query performance prediction is aimed at predicting the retrieval effectiveness that a query will achieve with respect to a particular ranking model. In this paper, we study quer...
Nattiya Kanhabua, Kjetil Nørvåg