Sciweavers

843 search results - page 66 / 169
» A Graph-cut Based Algorithm For Approximate Mrf Optimization
Sort
View
SIAMIS
2011
14 years 8 months ago
Gradient-Based Methods for Sparse Recovery
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
William W. Hager, Dzung T. Phan, Hongchao Zhang
GECCO
2008
Springer
186views Optimization» more  GECCO 2008»
15 years 2 months ago
A pareto following variation operator for fast-converging multiobjective evolutionary algorithms
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder, Michael Kirley, Ra...
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
15 years 5 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
CC
2007
Springer
157views System Software» more  CC 2007»
15 years 7 months ago
New Algorithms for SIMD Alignment
Optimizing programs for modern multiprocessor or vector platforms is a major important challenge for compilers today. In this work, we focus on one challenging aspect: the SIMD ALI...
Liza Fireman, Erez Petrank, Ayal Zaks
ICMCS
2006
IEEE
192views Multimedia» more  ICMCS 2006»
15 years 7 months ago
Classifier Optimization for Multimedia Semantic Concept Detection
In this paper, we present an AUC (i.e., the Area Under the Curve of Receiver Operating Characteristics (ROC)) maximization based learning algorithm to design the classifier for ma...
Sheng Gao, Qibin Sun