15 search results - page 2 / 3 » Examining Locally Varying Weights for Nearest Neighbor Algor... |
ADMA
2005
Springer
13 years 10 months ago
2005
Springer
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
CVPR
2004
IEEE
14 years 7 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
CSB
2004
IEEE
13 years 9 months ago
2004
IEEE
Feature selection and weighting are central problems in pattern recognition and instance-based learning. In this work, we discuss the challenges of constructing and weighting feat...
CVPR
2007
IEEE
14 years 7 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
PERVASIVE
2008
Springer
13 years 5 months ago
2008
Springer
In energy constrained wireless sensor networks, energy conservation techniques are to be applied in order to maximize the system lifetime. We tackle the problem of increasing netw...