Sciweavers

860 search results - page 141 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
ICIP
2005
IEEE
14 years 9 months ago
Color constancy based on the Grey-edge hypothesis
A well-known color constancy method is based on the GreyWorld assumption i.e. the average reflectance of surfaces in the world is achromatic. In this article we propose a new hypo...
Joost van de Weijer, Theo Gevers
ICML
2008
IEEE
14 years 8 months ago
Fast solvers and efficient implementations for distance metric learning
In this paper we study how to improve nearest neighbor classification by learning a Mahalanobis distance metric. We build on a recently proposed framework for distance metric lear...
Kilian Q. Weinberger, Lawrence K. Saul
FLAIRS
2004
13 years 9 months ago
A Faster Algorithm for Generalized Multiple-Instance Learning
In our prior work, we introduced a generalization of the multiple-instance learning (MIL) model in which a bag's label is not based on a single instance's proximity to a...
Qingping Tao, Stephen D. Scott
CLEF
2010
Springer
13 years 8 months ago
Patent Classification Experiments with the Linguistic Classification System LCS
In the context of the CLEF-IP 2010 classification task, we conducted a series of experiments with the Linguistic Classification System (LCS). We compared ment representations for p...
Suzan Verberne, Merijn Vogel, Eva D'hondt
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 7 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...