654 search results - page 30 / 131 » Matrix Graph Grammars |
131
Voted
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
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 ...
120
Voted
GG
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different...
125
Voted
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
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 ...
132
Voted
SGP
2003
15 years 5 months ago
2003
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 ...
131
click to vote
COLING
2010
14 years 10 months ago
2010
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...