654 search results - page 21 / 131 » Matrix Graph Grammars |
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
HASE
2008
IEEE
14 years 3 months ago
2008
IEEE
A high assurance system requires both functional and nonfunctional correctness before the system is put into operation. To examine whether a system’s actual performance complies...
ICTAI
2008
IEEE
14 years 3 months ago
2008
IEEE
This paper presents a grammar-induction based approach to partitioning a Web page into several small pages while each small page fits not only spatially but also logically for mob...
ECCC
2006
13 years 8 months ago
2006
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
BMVC
2001
13 years 11 months ago
2001
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...