4767 search results - page 406 / 954 » Structures for Abstract Rewriting |
159
click to vote
DASFAA
2004
IEEE
15 years 10 months ago
2004
IEEE
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
174
click to vote
DFG
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Motivated by the wide acceptance of component based technologies in software development, a component concept for software engineering is applied to modeling in the field...
156
click to vote
CIE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We prove that the homomorphic quasiorder of finite k-labeled forests has undecidable elementary theory for k 3, in contrast to the known decidability result for k = 2. W...
195
click to vote
CPM
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
192
click to vote
ERSHOV
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Research in dialogue systems has been moving towards reusable and adaptable architectures for managing dialogue execution and integrating heterogeneous subsystems. In thi...