Sciweavers

1403 search results - page 248 / 281
» Set cover algorithms for very large datasets
Sort
View
KDD
2007
ACM
156views Data Mining» more  KDD 2007»
14 years 9 months ago
Estimating rates of rare events at multiple resolutions
We consider the problem of estimating occurrence rates of rare events for extremely sparse data, using pre-existing hierarchies to perform inference at multiple resolutions. In pa...
Deepak Agarwal, Andrei Z. Broder, Deepayan Chakrab...
SIGMOD
2010
ACM
208views Database» more  SIGMOD 2010»
13 years 6 months ago
An automated, yet interactive and portable DB designer
Tuning tools attempt to configure a database to achieve optimal performance for a given workload. Selecting an optimal set of physical structures is computationally hard since it ...
Ioannis Alagiannis, Debabrata Dash, Karl Schnaitte...
ECCV
2002
Springer
14 years 10 months ago
An Affine Invariant Interest Point Detector
This paper presents a novel approach for detecting affine invariant interest points. Our method can deal with significant affine transformations including large scale changes. Such...
Krystian Mikolajczyk, Cordelia Schmid
ECCV
2004
Springer
14 years 10 months ago
Image Clustering with Metric, Local Linear Structure, and Affine Symmetry
Abstract. This paper addresses the problem of clustering images of objects seen from different viewpoints. That is, given an unlabelled set of images of n objects, we seek an unsup...
Jongwoo Lim, Jeffrey Ho, Ming-Hsuan Yang, Kuang-Ch...
KDD
2004
ACM
181views Data Mining» more  KDD 2004»
14 years 9 months ago
Column-generation boosting methods for mixture of kernels
We devise a boosting approach to classification and regression based on column generation using a mixture of kernels. Traditional kernel methods construct models based on a single...
Jinbo Bi, Tong Zhang, Kristin P. Bennett