Sciweavers

2489 search results - page 151 / 498
» On the Subgroup Distance Problem
Sort
View
125
Voted
FOCS
2004
IEEE
15 years 8 months ago
The Hardness of Metric Labeling
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
Julia Chuzhoy, Joseph Naor
ICDE
2010
IEEE
282views Database» more  ICDE 2010»
16 years 3 months ago
Quantile-Based KNN Over Multi-Valued Objects
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
Wenjie Zhang, Xuemin Lin, Muhammad Aamir Cheema, Y...
ECCV
2002
Springer
16 years 6 months ago
On Affine Invariant Clustering and Automatic Cast Listing in Movies
Abstract We develop a distance metric for clustering and classification algorithms which is invariant to affine transformations and includes priors on the transformation parameters...
Andrew W. Fitzgibbon, Andrew Zisserman
137
Voted
ICML
2008
IEEE
16 years 5 months ago
Metric embedding for kernel classification rules
In this paper, we consider a smoothing kernelbased classification rule and propose an algorithm for optimizing the performance of the rule by learning the bandwidth of the smoothi...
Bharath K. Sriperumbudur, Omer A. Lang, Gert R. G....
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
16 years 4 months ago
Extending autocompletion to tolerate errors
Autocompletion is a useful feature when a user is doing a look up from a table of records. With every letter being typed, autocompletion displays strings that are present in the t...
Surajit Chaudhuri, Raghav Kaushik