Sciweavers

654 search results - page 30 / 131
» Matrix Graph Grammars
Sort
View
ICALP
2004
Springer
14 years 2 months ago
Quantum Query Complexity of Some Graph Problems
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
Christoph Dürr, Mark Heiligman, Peter H&oslas...
GG
2004
Springer
14 years 2 months ago
Constraints and Application Conditions: From Graphs to High-Level Structures
Abstract. Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different...
Hartmut Ehrig, Karsten Ehrig, Annegret Habel, Karl...
AAIM
2007
Springer
97views Algorithms» more  AAIM 2007»
14 years 3 months ago
Probe Matrix Problems: Totally Balanced Matrices
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
David B. Chandler, Jiong Guo, Ton Kloks, Rolf Nied...
SGP
2003
13 years 10 months ago
Stellar Subdivision Grammars
In this paper we develop a new description for subdivision surfaces based on a graph grammar formalism. Subdivision schemes are specified by a context sensitive grammar in which ...
Luiz Velho
COLING
2010
13 years 3 months ago
A Formal Scheme for Multimodal Grammars
We present in this paper a formal approach for the representation of multimodal information. This approach, thanks to the to use of typed feature structures and hypergraphs, gener...
Philippe Blache, Laurent Prévot