Sciweavers

2314 search results - page 264 / 463
» Minimal Partitions of a Graph
Sort
View
ISBRA
2009
Springer
15 years 11 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
AAECC
2007
Springer
118views Algorithms» more  AAECC 2007»
15 years 10 months ago
The "Art of Trellis Decoding" Is NP-Hard
Given a linear code C, the fundamental problem of trellis decoding is to find a coordinate permutation of C that yields a code C′ whose minimal trellis has the least state-compl...
Navin Kashyap
CAV
2008
Springer
110views Hardware» more  CAV 2008»
15 years 6 months ago
Monotonic Abstraction for Programs with Dynamic Memory Heaps
c Abstraction for Programs with Dynamic Memory Heaps Parosh Aziz Abdulla1 , Ahmed Bouajjani2 , Jonathan Cederberg1 , Fr
Parosh Aziz Abdulla, Ahmed Bouajjani, Jonathan Ced...
145
Voted
CORR
2011
Springer
223views Education» more  CORR 2011»
14 years 11 months ago
Decentralized Formation Control Part I: Geometric Aspects
In this paper, we develop new methods for the analysis of decentralized control systems and we apply them to formation control problems. The basic set-up consists of a system with...
Mohamed-Ali Belabbas
ICPR
2004
IEEE
16 years 5 months ago
Landscape of Clustering Algorithms
Numerous clustering algorithms, their taxonomies and evaluation studies are available in the literature. Despite the diversity of different clustering algorithms, solutions delive...
Anil K. Jain, Alexander P. Topchy, Martin H. C. La...