Sciweavers

660 search results - page 104 / 132
» Hybrid CSP Solving
Sort
View
124
Voted
ECAI
2010
Springer
15 years 2 months ago
Improving the Global Constraint SoftPrec
A soft global constraint SOFTPREC has been proposed recently for solving optimisation problems involving precedence relations. In this paper we present new pruning rules for this g...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
130
Voted
ICASSP
2010
IEEE
15 years 2 months ago
A hierarchical Bayesian model for frame representation
In many signal processing problems, it may be fruitful to represent the signal under study in a redundant linear decomposition called a frame. If a probabilistic approach is adopt...
Lotfi Chaâri, Jean-Christophe Pesquet, Jean-...
145
Voted
PVLDB
2010
200views more  PVLDB 2010»
15 years 2 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin
PROCEDIA
2011
14 years 6 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
136
Voted
RECOMB
2005
Springer
16 years 3 months ago
Constructing a Smallest Refining Galled Phylogenetic Network
Reticulation events occur frequently in many types of species. Therefore, to develop accurate methods for reconstructing phylogenetic networks in order to describe evolutionary his...
Trinh N. D. Huynh, Jesper Jansson, Nguyen Bao Nguy...