Sciweavers

279 search results - page 16 / 56
» Tree Pattern Rewriting Systems
Sort
View
CADE
2006
Springer
14 years 10 months ago
Tree Automata with Equality Constraints Modulo Equational Theories
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
Florent Jacquemard, Laurent Vigneron, Michaël...
IFIP
2004
Springer
14 years 3 months ago
Regular Tree Language Recognition with Static Information
This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type syst...
Alain Frisch
MCS
2011
Springer
13 years 4 months ago
The geometry and dynamics of binary trees
: The modeling of a fully populated 3D tree able to regulate dynamically remains a relatively unexplored field. A non-dimensional representation of “autoregulation” coupled wit...
T. David, Thomas van Kempen, Huaxiong Huang, Phill...
IRI
2008
IEEE
14 years 4 months ago
Compound record clustering algorithm for design pattern detection by decision tree learning
Recovering design patterns applied in a system can help refactoring the system. Machine learning algorithms have been successfully applied in mining data patterns. However, one of...
Jing Dong, Yongtao Sun, Yajing Zhao
GLOBECOM
2008
IEEE
13 years 10 months ago
An Efficient Tree Search for Reduced Complexity Sphere Decoding
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
Luay Azzam, Ender Ayanoglu