Sciweavers

882 search results - page 128 / 177
» Local Search for Very Large SAT Problems
Sort
View
INTERSPEECH
2010
15 years 9 days ago
Unsupervised discovery and training of maximally dissimilar cluster models
One of the difficult problems of acoustic modeling for Automatic Speech Recognition (ASR) is how to adequately model the wide variety of acoustic conditions which may be present i...
Françoise Beaufays, Vincent Vanhoucke, Bria...
CVPR
2009
IEEE
17 years 18 days ago
HOP: Hierarchical Object Parsing
In this paper we consider the problem of object parsing, namely detecting an object and its components by composing them from image observations. Apart from object localization, ...
Iasonas Kokkinos, Alan L. Yuille
ICCV
2009
IEEE
16 years 10 months ago
Optimizing Parametric Total Variation Models
One of the key factors for the success of recent energy minimization methods is that they seek to compute global solutions. Even for non-convex energy functionals, optimization ...
Petter Strandmark, Fredrik Kahl, Niels Chr. Overga...
WINE
2009
Springer
138views Economy» more  WINE 2009»
16 years 2 days ago
Covering Games: Approximation through Non-cooperation
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
Martin Gairing
JNCA
2011
102views more  JNCA 2011»
14 years 8 months ago
Multi-objective zone mapping in large-scale distributed virtual environments
In large-scale distributed virtual environments (DVEs), the NP-hard zone mapping problem concerns how to assign distinct zones of the virtual world to a number of distributed serv...
Ta Nguyen Binh Duong, Suiping Zhou, Wentong Cai, X...