Sciweavers

4137 search results - page 262 / 828
» On the number of matchings of a tree
Sort
View
FLOPS
2004
Springer
15 years 10 months ago
Implementing Natural Rewriting and Narrowing Efficiently
Abstract. Outermost-needed rewriting/narrowing is a sound and complete optimal demand-driven strategy for the class of inductively sequential constructor systems. Its parallel exte...
Santiago Escobar
BIRD
2008
Springer
177views Bioinformatics» more  BIRD 2008»
15 years 8 months ago
Fast Structured Motif Search in DNA Sequences
We study the problem of structured motif search in DNA sequences. This is a fundamental task in bioinformatics which contributes to better understanding of genome characteristics a...
Mihail Halachev, Nematollaah Shiri
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
16 years 4 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen
HICSS
2008
IEEE
119views Biometrics» more  HICSS 2008»
16 years 1 months ago
Tree Mining in Mental Health Domain
The number of mentally ill people is increasing globally each year. Despite major medical advances, the identification of genetic and environmental factors responsible for mental ...
Maja Hadzic, Fedja Hadzic, Tharam S. Dillon
TAMC
2007
Springer
16 years 25 days ago
Approximately Optimal Trees for Group Key Management with Batch Updates
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
Minming Li, Ze Feng, Ronald L. Graham, Frances F. ...