Sciweavers

2157 search results - page 240 / 432
» Optimal Fast Hashing
Sort
View
DAC
2005
ACM
16 years 4 months ago
An efficient algorithm for statistical minimization of total power under timing yield constraints
Power minimization under variability is formulated as a rigorous statistical robust optimization program with a guarantee of power and timing yields. Both power and timing metrics...
Murari Mani, Anirudh Devgan, Michael Orshansky
CVPR
2010
IEEE
1192views Computer Vision» more  CVPR 2010»
15 years 12 months ago
RASL: Robust Alignment by Sparse and Low-rank Decomposition for Linearly Correlated Images
This paper studies the problem of simultaneously aligning a batch of linearly correlated images despite gross corruption (such as occlusion). Our method seeks an optimal set of im...
Yigang Peng, Arvind Balasubramanian, John Wright, ...
126
Voted
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
15 years 9 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
CRV
2005
IEEE
201views Robotics» more  CRV 2005»
15 years 9 months ago
Minimum Bayes Error Features for Visual Recognition by Sequential Feature Selection and Extraction
The extraction of optimal features, in a classification sense, is still quite challenging in the context of large-scale classification problems (such as visual recognition), inv...
Gustavo Carneiro, Nuno Vasconcelos
124
Voted
CC
2003
Springer
15 years 8 months ago
Improving Data Locality by Chunking
Cache memories were invented to decouple fast processors from slow memories. However, this decoupling is only partial, and many researchers have attempted to improve cache use by p...
Cédric Bastoul, Paul Feautrier