Sciweavers

4137 search results - page 100 / 828
» On the number of matchings of a tree
Sort
View
CORR
2008
Springer
120views Education» more  CORR 2008»
15 years 6 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
IPL
2008
169views more  IPL 2008»
15 years 6 months ago
Oriented colorings of partial 2-trees
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping f from V(G) to V(H), that is f(x)f(y) is an arc in H whenever xy is an arc in G. The or...
Pascal Ochem, Alexandre Pinlou
ACNS
2009
Springer
113views Cryptology» more  ACNS 2009»
15 years 10 months ago
Fast Packet Classification Using Condition Factorization
Abstract. Rule-based packet classification plays a central role in network intrusion detection systems such as Snort. To enhance performance, these rules are typically compiled int...
Alok Tongaonkar, R. Sekar, Sreenaath Vasudevan
DAGM
2007
Springer
16 years 18 days ago
Extraction of 3D Unfoliaged Trees from Image Sequences Via a Generative Statistical Approach
In this paper we propose a generative statistical approach for the three dimensional (3D) extraction of the branching structure of unfoliaged deciduous trees from urban image seque...
Hai Huang, Helmut Mayer
NJC
2006
102views more  NJC 2006»
15 years 6 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea