16404 search results - page 3066 / 3281 » A set coverage problem |
153
click to vote
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
We consider the problem of learning with instances defined over a space of sets of vectors. We derive a new positive definite kernel f(A B) defined over pairs of matrices A B base...
151
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up corres...
158
click to vote
CVPR
2007
IEEE
2007
IEEE
Discriminative Cluster Refinement: Improving Object Category Recognition Given Limited Training Data
16 years 6 months ago
A popular approach to problems in image classification is to represent the image as a bag of visual words and then employ a classifier to categorize the image. Unfortunately, a si...
142
Voted
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
133
Voted
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Nearest neighbour classifiers and related kernel methods often perform poorly in high dimensional problems because it is infeasible to include enough training samples to cover the...