Sciweavers

213 search results - page 19 / 43
» Relating Word and Tree Automata
Sort
View
APPML
2010
86views more  APPML 2010»
13 years 7 months ago
A note on single-linkage equivalence
We introduce the concept of single-linkage equivalence of edge-weighted graphs, we apply it to characterise maximal spanning trees and "ultrasimilarities", and we discus...
Andreas W. M. Dress, Taoyang Wu, XiaoMing Xu
SCP
2010
126views more  SCP 2010»
13 years 6 months ago
Component simulation-based substitutivity managing QoS and composition issues
Several scientic bottlenecks have been identied in existing component-based approaches. em, we focus on the identication of a relevant abstraction for the component expression ...
Pierre-Cyrille Héam, Olga Kouchnarenko, J&e...
POPL
2006
ACM
14 years 7 months ago
Polymorphic regular tree types and patterns
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
Jerome Vouillon
SP
2008
IEEE
112views Security Privacy» more  SP 2008»
14 years 1 months ago
XFA: Faster Signature Matching with Extended Automata
Automata-based representations and related algorithms have been applied to address several problems in information security, and often the automata had to be augmented with additi...
Randy Smith, Cristian Estan, Somesh Jha
26
Voted
ACL
2009
13 years 5 months ago
Sentence diagram generation using dependency parsing
Dependency parsers show syntactic relations between words using a directed graph, but comparing dependency parsers is difficult because of differences in theoretical models. We de...
Elijah Mayfield