Sciweavers

3517 search results - page 226 / 704
» Online Learning with Queries
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 4 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
16 years 6 months ago
Scalable approximate query processing with the DBO engine
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
Christopher M. Jermaine, Subramanian Arumugam, Abh...
PDP
2008
IEEE
16 years 29 days ago
Load Balancing Distributed Inverted Files: Query Ranking
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
Carlos Gomez-Pantoja, Mauricio Marín
CSR
2007
Springer
16 years 23 days ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
SIGIR
1999
ACM
15 years 11 months ago
From Reading to Retrieval: Freeform Ink Annotations as Queries
User interfaces for digital libraries tend to focus on retrieval: users retrieve documents online, but then print them out and work with them on paper. One reason for printing doc...
Gene Golovchinsky, Morgan N. Price, Bill N. Schili...