105 search results - page 13 / 21 » Almost Optimal Solutions to k-Clustering Problems |
101
click to vote
PAMI
2007
14 years 11 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
88
Voted
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
We address the problem of registering a sequence of images in a moving dynamic texture video. This involves optimization with respect to camera motion, the average image, and the ...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The Building Block Hypothesis suggests that Genetic Algorithms (GAs) are well-suited for hierarchical problems, where efficient solving requires proper problem decomposition and a...
102
click to vote
ANCS
2005
ACM
15 years 5 months ago
2005
ACM
Task to resource mapping problems are encountered during (i) hardware-software co-design and (ii) performance optimization of Network Processor systems. The goal of the first pro...
112
click to vote
VLSID
2002
IEEE
16 years 3 days ago
2002
IEEE
An important class of problems used widely in both the embedded systems and scientific domains perform memory intensive computations on large data sets. These data sets get to be ...