227 search results - page 24 / 46 » Complexity Results for Compressing Optimal Paths |
FPGA
2010
ACM
15 years 8 months ago
2010
ACM
Deep submicron processes have allowed FPGAs to grow in complexity and speed. However, such technology scaling has caused FPGAs to become more susceptible to the effects of process...
132
Voted
ICCV
2011
IEEE
13 years 11 months ago
2011
IEEE
In geometric computer vision, the structure from motion (SfM) problem can be formulated as a optimization problem with a rank constraint. It is well known that the trace norm of a...
112
click to vote
CEC
2008
IEEE
15 years 5 months ago
2008
IEEE
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
113
click to vote
TPDS
2002
14 years 10 months ago
2002
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
101
click to vote
MM
2005
ACM
15 years 4 months ago
2005
ACM
To locate a video clip in large collections is very important for retrieval applications, especially for digital rights management. In this paper, we present a novel technique for...