Sciweavers

4971 search results - page 878 / 995
» On Scalable Information Retrieval Systems
Sort
View
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
16 years 6 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
CIKM
2010
Springer
15 years 4 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
SIGIR
1997
ACM
15 years 10 months ago
Learning Routing Queries in a Query Zone
Word usage is domain dependent. A common word in one domain can be quite infrequent in another. In this study we exploit this property of word usage to improve document routing. W...
Amit Singhal, Mandar Mitra, Chris Buckley
WWW
2009
ACM
16 years 7 months ago
Learning consensus opinion: mining data from a labeling game
We consider the problem of identifying the consensus ranking for the results of a query, given preferences among those results from a set of individual users. Once consensus ranki...
Paul N. Bennett, David Maxwell Chickering, Anton M...
WWW
2010
ACM
16 years 1 months ago
Entity relation discovery from web tables and links
The World-Wide Web consists not only of a huge number of unstructured texts, but also a vast amount of valuable structured data. Web tables [2] are a typical type of structured in...
Cindy Xide Lin, Bo Zhao, Tim Weninger, Jiawei Han,...