Sciweavers

160 search results - page 20 / 32
» Reductions for Learning via Queries
Sort
View
CHI
2011
ACM
12 years 11 months ago
Characterizing the usability of interactive applications through query log analysis
People routinely rely on Internet search engines to support their use of interactive systems: they issue queries to learn how to accomplish tasks, troubleshoot problems, and other...
Adam Fourney, Richard Mann, Michael Terry
WWW
2005
ACM
14 years 8 months ago
Adaptive query routing in peer web search
An unstructured peer network application was proposed to address the query forwarding problem of distributed search engines and scalability limitations of centralized search engin...
Le-Shin Wu, Ruj Akavipat, Filippo Menczer
ICDE
2010
IEEE
171views Database» more  ICDE 2010»
14 years 7 months ago
Surrogate Ranking for Very Expensive Similarity Queries
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
Chris Jermaine, Fei Xu, Mingxi Wu, Ravi Jampani, T...
CIKM
2008
Springer
13 years 9 months ago
Identifying table boundaries in digital documents via sparse line detection
Most prior work on information extraction has focused on extracting information from text in digital documents. However, often, the most important information being reported in an...
Ying Liu, Prasenjit Mitra, C. Lee Giles
ML
2007
ACM
108views Machine Learning» more  ML 2007»
13 years 7 months ago
Unconditional lower bounds for learning intersections of halfspaces
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
Adam R. Klivans, Alexander A. Sherstov