2492 search results - page 201 / 499 » On the General Signature Trees |
179
click to vote
DOCENG
2003
ACM
15 years 12 months ago
2003
ACM
In this paper, we propose to extend XQuery - the XML query language - with a set of transformation operators which will produce a copy of an XML tree in which some subtrees will b...
185
click to vote
IBPRIA
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In a previous work, a new probabilistic context-free grammar (PCFG) model for natural language parsing derived from a tree bank corpus has been introduced. The model esti...
156
click to vote
CONCUR
1998
Springer
15 years 10 months ago
1998
Springer
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest viewing PA-processes as trees, and using treeautomata technique...
184
click to vote
KDD
1994
ACM
15 years 10 months ago
1994
ACM
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...
147
click to vote
AMAST
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Accumulation techniques were invented to transform functional programs, which intensively use append functions (like inefficient list reversal), into more efficient progr...