Sciweavers

3415 search results - page 320 / 683
» Lower bounds on kernelization
Sort
View
CPAIOR
2008
Springer
15 years 8 months ago
Efficient Haplotype Inference with Combined CP and OR Techniques
Abstract. Haplotype inference has relevant biological applications, and represents a challenging computational problem. Among others, pure parsimony provides a viable modeling appr...
Ana Graça, João Marques-Silva, In&ec...
ECAI
2008
Springer
15 years 8 months ago
Dynamic Backtracking for Distributed Constraint Optimization
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
Redouane Ezzahir, Christian Bessiere, Imade Benela...
ECAI
2008
Springer
15 years 8 months ago
Structure segmentation and recognition in images guided by structural constraint propagation
In some application domains, such as medical imaging, the objects that compose the scene are known as well as some of their properties and their spatial arrangement. We can take ad...
Olivier Nempont, Jamal Atif, Elsa D. Angelini, Isa...
FM
2008
Springer
148views Formal Methods» more  FM 2008»
15 years 8 months ago
Precise Interval Analysis vs. Parity Games
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
Thomas Gawlitza, Helmut Seidl
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
15 years 8 months ago
Making k-means Even Faster
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
Greg Hamerly