648 search results - page 6 / 130 » A general dimension for query learning |
COMPGEOM
1994
ACM
13 years 11 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
NIPS
2007
13 years 9 months ago
2007
We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of C...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
Time is an important dimension of relevance for a large number of searches, such as over blogs and news archives. So far, research on searching over such collections has largely f...
EDBT
2009
ACM
14 years 2 months ago
2009
ACM
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
SEBD
2004
13 years 9 months ago
2004
The problem of integrating autonomous data marts arises when, e.g., a large organization (or a federation thereof) needs to combine independently developed data warehouses. It turn...