1511 search results - page 127 / 303 » Hierarchical Graph Transformation |
346
click to vote
PAMI
2010
15 years 3 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
141
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
179
click to vote
DAC
1998
ACM
15 years 9 months ago
1998
ACM
We present a technique for synthesizing power- as well as area-optimized circuits from hierarchical data flow graphs under throughput constraints. We allow for the use of complex...
144
click to vote
BMCBI
2006
15 years 5 months ago
2006
Background: The exploration of the structural topology and the organizing principles of genomebased large-scale metabolic networks is essential for studying possible relations bet...
157
click to vote
SYNASC
2008
IEEE
15 years 11 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...