Sciweavers

971 search results - page 96 / 195
» Approximate Satisfiability and Equivalence
Sort
View
126
Voted
RECOMB
2006
Springer
16 years 1 months ago
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
Abstract. During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chrom...
Martin Bader, Enno Ohlebusch
101
Voted
DCC
2002
IEEE
16 years 9 days ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
MFCS
2007
Springer
15 years 6 months ago
On the Complexity of Computing Treelength
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
Daniel Lokshtanov
119
Voted
NLDB
2007
Springer
15 years 6 months ago
Selecting Labels for News Document Clusters
This work deals with determination of meaningful and terse cluster labels for News document clusters. We analyze a number of alternatives for selecting headlines and/or sentences o...
Krishnaprasad Thirunarayan, Trivikram Immaneni, Ma...
85
Voted
ICIAR
2005
Springer
15 years 6 months ago
Compressing 2-D Shapes Using Concavity Trees
Concavity trees have been known for quite some time as structural descriptors of 2-D shape; however, they haven’t been explored further until recently. This paper shows how 2-D s...
Ossama El Badawy, Mohamed S. Kamel