Sciweavers

906 search results - page 58 / 182
» Matching Subsequences in Trees
Sort
View
PODS
2007
ACM
104views Database» more  PODS 2007»
14 years 10 months ago
XML transformation by tree-walking transducers with invisible pebbles
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samw...
BICOB
2009
Springer
14 years 4 months ago
Generalized Binary Tanglegrams: Algorithms and Applications
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
Mukul S. Bansal, Wen-Chieh Chang 0002, Oliver Eule...
MT
2006
106views more  MT 2006»
13 years 10 months ago
Example-based machine translation based on tree-string correspondence and statistical generation
Abstract. This paper describes an example-based machine translation (EBMT) method based on tree-string correspondence (TSC) and statistical generation. In this method, the translat...
Zhan-yi Liu, Haifeng Wang, Hua Wu
FCCM
2005
IEEE
102views VLSI» more  FCCM 2005»
14 years 3 months ago
A Signature Match Processor Architecture for Network Intrusion Detection
In this paper, we introduce a novel architecture for a hardware based network intrusion detection system (NIDS). NIDSs are becoming critical components of the network infrastructu...
Janardhan Singaraju, Long Bu, John A. Chandy
ISAAC
1998
Springer
66views Algorithms» more  ISAAC 1998»
14 years 2 months ago
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
Josep Díaz, Jordi Petit, Panagiotis Psychar...