1418 search results - page 242 / 284 » The Dynamic Complexity of Formal Languages |
136
Voted
GG
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
181
Voted
JMLR
2008
15 years 4 months ago
2008
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
170
click to vote
PVLDB
2008
15 years 4 months ago
2008
This paper studies, for the first time, the management of type information for an important class of semi-structured data: nested DAGs (Directed Acyclic Graphs) that describe exec...
142
Voted
CASES
2010
ACM
15 years 3 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
225
click to vote
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, ...