6365 search results - page 814 / 1273 » Fast Local Computation Algorithms |
227
click to vote
STACS
2007
Springer
16 years 1 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
301
Voted
CVPR
2009
IEEE
17 years 9 days ago
2009
IEEE
We propose a novel tracking algorithm for the target of which geometric appearance changes drastically over time. To track it, we present a local patch-based appearance model and p...
175
Voted
ICNS
2008
IEEE
16 years 2 months ago
2008
IEEE
Congestion control algorithms are traditionally evaluated in contrast to ideal capacity allocations that specify instantaneous efficient fair rates for application sessions but i...
195
Voted
PVM
2004
Springer
16 years 28 days ago
2004
Springer
On recent PC graphics cards, fully programmable parallel geometry and pixel units are available providing powerful instruction sets to perform arithmetic and logical operations. In...
170
click to vote
ICPR
2004
IEEE
16 years 8 months ago
2004
IEEE
We propose an algorithm creating consistent, dense disparity maps from incomplete disparity data generated by a conventional stereo system used in a wide-baseline configuration. T...