Sciweavers

3049 search results - page 588 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
14 years 2 months ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...
RECOMB
1997
Springer
14 years 24 days ago
On the complexity and approximation of syntenic distance
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming ...
IJCAI
2007
13 years 10 months ago
A Study of Residual Supports in Arc Consistency
In an Arc Consistency (AC) algorithm, a residual support, or residue, is a support that has been stored during a previous execution of the procedure which determines if a value is ...
Christophe Lecoutre, Fred Hemery
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 8 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 9 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer