Sciweavers

1550 search results - page 33 / 310
» Optimizing search by showing results in context
Sort
View
CPAIOR
2010
Springer
13 years 11 months ago
An In-Out Approach to Disjunctive Optimization
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
Matteo Fischetti, Domenico Salvagnin
IRFC
2010
Springer
14 years 19 days ago
Knowledge Modeling in Prior Art Search
This study explores the benefits of integrating knowledge representations in prior art patent retrieval. Key to the introduced approach is the utilization of human judgment availa...
Erik Graf, Ingo Frommholz, Mounia Lalmas, Keith va...
CRV
2005
IEEE
201views Robotics» more  CRV 2005»
14 years 1 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
ICASSP
2011
IEEE
12 years 11 months ago
Efficient context adaptive entropy coding for real-time applications
Context based entropy coding has the potential to provide higher gain over memoryless entropy coding. However serious difficulties arise regarding the practical implementation in...
Guillaume Fuchs, Vignesh Subbaraman, Markus Multru...
ICASSP
2008
IEEE
14 years 2 months ago
Distributed average consensus with increased convergence rate
The average consensus problem in the distributed signal processing context is addressed by linear iterative algorithms, with asymptotic convergence to the consensus. The convergen...
Boris N. Oreshkin, Tuncer C. Aysal, Mark Coates