5771 search results - page 1074 / 1155 » Learning similarity space |
153
Voted
KDD
2012
ACM
13 years 6 months ago
2012
ACM
Building an accurate emerging pattern classifier with a highdimensional dataset is a challenging issue. The problem becomes even more difficult if the whole feature space is unava...
125
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
162
click to vote
SIAMMA
2011
14 years 7 months ago
2011
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...
141
Voted
CVPR
1999
IEEE
16 years 6 months ago
1999
IEEE
This paper presents a novel approach for detection and segmentation of generic shapes in cluttered images. The underlying assumption is that generic objects that are man made, fre...
157
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
Coalescence, meaning the tracker associates more than one trajectories to some targets while loses track for others, is a challenging problem for visual tracking of multiple targe...