Sciweavers

2834 search results - page 75 / 567
» Representing Trees with Constraints
Sort
View
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 9 months ago
A new distance for high level RNA secondary structure comparison
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two new operations, called node fusion and edge fusion, besides the t...
Julien Allali, Marie-France Sagot
EOR
2006
110views more  EOR 2006»
13 years 9 months ago
Scatter search with path relinking for phylogenetic inference
We propose the use of scatter search with path relinking for the inference of phylogenetic trees. Solutions are here represented as trees whose leaves span the set of species unde...
Carlos Cotta
DAC
1999
ACM
14 years 10 months ago
Constraint Driven Code Selection for Fixed-Point DSPs
Abstract? Fixed-point DSPs are a class of embedded processors with highly irregular architectures. This irregularity makes it difficult to generate high-quality machine code from p...
Steven Bashford, Rainer Leupers
DAC
2000
ACM
14 years 1 months ago
Block placement with symmetry constraints based on the O-tree non-slicing representation
The ordered tree (O-tree) representation has recently gained much interest in layout design automation. Different from previous topological representations of non-slicing floorpl...
Yingxin Pang, Florin Balasa, Koen Lampaert, Chung-...
ICASSP
2010
IEEE
13 years 9 months ago
Multiplicative update rules for nonnegative matrix factorization with co-occurrence constraints
Nonnegative matrix factorization (NMF) is a widely-used tool for obtaining low-rank approximations of nonnegative data such as digital images, audio signals, textual data, financ...
Steven K. Tjoa, K. J. Ray Liu