1064 search results - page 110 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
128
click to vote
AAAI
2007
15 years 6 months ago
2007
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
261
click to vote
ICPR
2010
IEEE
15 years 11 months ago
2010
IEEE
This paper deals with feature matching and segmentation of common objects in a pair of images, simultaneously. For the feature matching problem, the matching likelihoods of all fea...
193
click to vote
STOC
1998
ACM
15 years 8 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
147
click to vote
RECOMB
2009
Springer
15 years 11 months ago
2009
Springer
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...
166
click to vote
ISCAS
2011
IEEE
14 years 8 months ago
2011
IEEE
— The last two decades have seen many efficient algorithms and architectures for the design of low-complexity bit-parallel Multiple Constant Multiplications (MCM) operation, tha...