Sciweavers

15485 search results - page 28 / 3097
» Computing Optimal Subsets
Sort
View
ECCV
2010
Springer
13 years 9 months ago
Towards More Efficient and Effective LP-based algorithms for MRF Optimization
This paper proposes a framework that provides significant speed-ups and also improves the effectiveness of general message passing algorithms based on dual LP relaxations. It is ap...
NAACL
2010
13 years 5 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
JMLR
2012
11 years 10 months ago
SpeedBoost: Anytime Prediction with Uniform Near-Optimality
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
Alexander Grubb, Drew Bagnell
ICIAR
2005
Springer
14 years 1 months ago
Robust Global Mosaic Topology Estimation for Real-Time Applications
This paper proposes an iterative methodology for real-time robust mosaic topology inference. It tackles the problem of optimal feature selection (optimal sampling) for global estim...
Nuno Pinho da Silva, João Paulo Costeira
GECCO
2008
Springer
158views Optimization» more  GECCO 2008»
13 years 8 months ago
Objective reduction using a feature selection technique
This paper introduces two new algorithms to reduce the number of objectives in a multiobjective problem by identifying the most conflicting objectives. The proposed algorithms ar...
Antonio López Jaimes, Carlos A. Coello Coel...