Sciweavers

301 search results - page 54 / 61
» Efficient Sketches for the Set Query Problem
Sort
View
112
Voted
CVPR
2006
IEEE
16 years 2 months ago
SVM-KNN: Discriminative Nearest Neighbor Classification for Visual Category Recognition
We consider visual category recognition in the framework of measuring similarities, or equivalently perceptual distances, to prototype examples of categories. This approach is qui...
Alexander C. Berg, Hao Zhang 0003, Jitendra Malik,...
PODS
2006
ACM
137views Database» more  PODS 2006»
16 years 15 days ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
98
Voted
ICS
2010
Tsinghua U.
15 years 9 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
WWW
2003
ACM
16 years 1 months ago
Text joins in an RDBMS for web data integration
The integration of data produced and collected across autonomous, heterogeneous web services is an increasingly important and challenging problem. Due to the lack of global identi...
Luis Gravano, Panagiotis G. Ipeirotis, Nick Koudas...
204
Voted
SIGMOD
2005
ACM
143views Database» more  SIGMOD 2005»
16 years 16 days ago
Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
Graham Cormode, Minos N. Garofalakis, S. Muthukris...