Sciweavers

699 search results - page 45 / 140
» The method of combinatorial telescoping
Sort
View
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
13 years 8 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
BMVC
2010
13 years 6 months ago
Learning Directional Local Pairwise Bases with Sparse Coding
Recently, sparse coding has been receiving much attention in object and scene recognition tasks because of its superiority in learning an effective codebook over k-means clusterin...
Nobuyuki Morioka, Shin'ichi Satoh
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 3 months ago
Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
Sisir Koppaka, Ashish Ranjan Hota
CSR
2011
Springer
13 years 1 days ago
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
Daniil Musatov
ICCV
2011
IEEE
12 years 8 months ago
Optimal Landmark Detection using Shape Models and Branch and Bound
Fitting statistical 2D and 3D shape models to images is necessary for a variety of tasks, such as video editing and face recognition. Much progress has been made on local fitting...
Brian Amberg, Thomas Vetter