2254 search results - page 300 / 451 » Computing the minimal covering set |
180
click to vote
TKDE
2008
15 years 6 months ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
255
Voted
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding t...
160
click to vote
CVPR
2008
IEEE
16 years 8 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...
155
click to vote
ECCV
2004
Springer
16 years 8 months ago
2004
Springer
Methods based on local, viewpoint invariant features have proven capable of recognizing objects in spite of viewpoint changes, occlusion and clutter. However, these approaches fail...
150
click to vote
DAC
2008
ACM
16 years 7 months ago
2008
ACM
Design-time decisions can often only cover certain scenarios and fail in efficiency when hard-to-predict system scenarios occur. This drives the development of run-time adaptive s...