2009 search results - page 105 / 402 » Dense Interest Points |
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
ICVS
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. In this paper we present experimental results on a novel application of visual attention mechanisms for the selection of points of interest in an arbitrary scene. The ima...
KDD
2001
ACM
14 years 8 months ago
2001
ACM
This paper is concerned with the construction of regression and classification trees that are more adapted to data mining applications than conventional trees. To this end, we pro...
AUSAI
2005
Springer
14 years 1 months ago
2005
Springer
Most data-mining techniques seek a single model that optimizes an objective function with respect to the data. In many real-world applications several models will equally optimize...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
This paper introduces a new shape matching algorithm for computing correspondences between 3D surfaces that have undergone (approximately) isometric deformations. The new approach ...