Sciweavers

1088 search results - page 85 / 218
» Probabilistic query expansion using query logs
Sort
View
CIKM
2008
Springer
13 years 11 months ago
Using English information in non-English web search
The leading web search engines have spent a decade building highly specialized ranking functions for English web pages. One of the reasons these ranking functions are effective is...
Wei Gao, John Blitzer, Ming Zhou
DIS
2001
Springer
14 years 1 months ago
Dynamic Aggregation to Support Pattern Discovery: A Case Study with Web Logs
Rapid growth of digital data collections is overwhelming the capabilities of humans to comprehend them without aid. The extraction of useful data from large raw data sets is someth...
Lida Tang, Ben Shneiderman
EACL
2006
ACL Anthology
13 years 10 months ago
A Two-Stage Approach to Retrieving Answers for How-To Questions
This paper addresses the problem of automatically retrieving answers for how-to questions, focusing on those that inquire about the procedure for achieving a specific goal. For su...
Ling Yin
FOCS
1991
IEEE
14 years 19 days ago
Dynamic Three-Dimensional Linear Programming
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
David Eppstein
SIGMOD
2010
ACM
153views Database» more  SIGMOD 2010»
14 years 1 months ago
Threshold query optimization for uncertain data
The probabilistic threshold query (PTQ) is one of the most common queries in uncertain databases, where all results satisfying the query with probabilities that meet the threshold...
Yinian Qi, Rohit Jain, Sarvjeet Singh, Sunil Prabh...