1478 search results - page 117 / 296 » Modular Complexity Analysis via Relative Complexity |
BALT
2010
13 years 4 months ago
2010
Abstract. This paper addresses the pattern matching problem for model transformation languages. Despite being an NP-complete problem, the pattern matching can be solved efficiently...
PODS
2010
ACM
14 years 2 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
ECBS
2005
IEEE
14 years 2 months ago
2005
IEEE
Testing complex Computer-Based Systems is not only a demanding but a very critical task. Therefore the use of models for generating test data is an important goal. Tool support du...
TLSDKCS
2010
13 years 3 months ago
2010
Abstract. With increasing volumes of data, much effort has been devoted to finding the most suitable answer to an information need. However, in many domains, the question whether a...
IM
2008
13 years 9 months ago
2008
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...