Results 1 - 10 of 987

Marker-directed Optimization of UnCAL Graph Transformations

by Soichiro Hidaka, Zhenjiang Hu, Kazuhiro Inaba, Hiroyuki Kato, Keisuke Nakano, Isao Sasano, et al. , 2011
"... Buneman et al. proposed a graph algebra called UnCAL (Unstructured CALculus) for compositional graph transformations based on structural recursion, and we have recently applied to model transformations. The compositional nature of the algebra greatly enhances the modularity of transformations. How ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
Buneman et al. proposed a graph algebra called UnCAL (Unstructured CALculus) for compositional graph transformations based on structural recursion, and we have recently applied to model transformations. The compositional nature of the algebra greatly enhances the modularity of transformations

The program dependence graph and its use in optimization

by Jeanne Ferrante, Karl J. Ottenstein, Joe D. Warren - ACM Transactions on Programming Languages and Systems , 1987
"... In this paper we present an intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependence5 for each operation in a program. Data dependences have been used to represent only the relevant data flow relationships of a program. ..."
Abstract - Cited by 996 (3 self) - Add to MetaCart
. Control dependence5 are introduced to analogously represent only the essential control flow relationships of a program. Control dependences are derived from the usual control flow graph. Many traditional optimizations operate more efficiently on the PDG. Since dependences in the PDG connect

Graphcut textures: Image and video synthesis using graph cuts

by Vivek Kwatra, Arno Schödl, Irfan Essa, Greg Turk, Aaron Bobick - ACM Transactions on Graphics, SIGGRAPH 2003 , 2003
"... This banner was generated by merging the source images in Figure 6 using our interactive texture merging technique. In this paper we introduce a new algorithm for image and video texture synthesis. In our approach, patch regions from a sample image or video are transformed and copied to the output a ..."
Abstract - Cited by 490 (9 self) - Add to MetaCart
and then stitched together along optimal seams to generate a new (and typically larger) output. In contrast to other techniques, the size of the patch is not chosen a-priori, but instead a graph cut technique is used to determine the optimal patch region for any given offset between the input and output texture

Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization

by Farid Alizadeh - SIAM Journal on Optimization , 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract - Cited by 547 (12 self) - Add to MetaCart
to SDP. Next we present an interior point algorithm which converges to the optimal solution in polynomial time. The approach is a direct extension of Ye's projective method for linear programming. We also argue that most known interior point methods for linear programs can be transformed in a

Coverage Problems in Wireless Ad-hoc Sensor Networks

by Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, Mani B. Srivastava - in IEEE INFOCOM , 2001
"... Wireless ad-hoc sensor networks have recently emerged as a premier research topic. They have great longterm economic potential, ability to transform our lives, and pose many new system-building challenges. Sensor networks also pose a number of new conceptual and optimization problems. Some, such as ..."
Abstract - Cited by 441 (9 self) - Add to MetaCart
Wireless ad-hoc sensor networks have recently emerged as a premier research topic. They have great longterm economic potential, ability to transform our lives, and pose many new system-building challenges. Sensor networks also pose a number of new conceptual and optimization problems. Some

Retiming Synchronous Circuitry

by Charles E. Leiserson, James B. Saxe - ALGORITHMICA , 1991
"... This paper describes a circuit transformation called retiming in which registers are added at some points in a circuit and removed from others in such a way that the functional behavior of the circuit as a whole is preserved. We show that retiming can be used to transform a given synchronous circui ..."
Abstract - Cited by 376 (3 self) - Add to MetaCart
This paper describes a circuit transformation called retiming in which registers are added at some points in a circuit and removed from others in such a way that the functional behavior of the circuit as a whole is preserved. We show that retiming can be used to transform a given synchronous

Recognition of Shapes by Editing Their Shock Graphs

by Thomas B. Sebastian, Philip N. Klein, Benjamin B. Kimia , 2004
"... This paper presents a novel framework for the recognition of objects based on their silhouettes. The main idea is to measure the distance between two shapes as the minimum extent of deformation necessary for one shape to match the other. Since the space of deformations is very high-dimensional, thr ..."
Abstract - Cited by 204 (8 self) - Add to MetaCart
. Despite these steps, which tremendously reduce the search requirement, there still remain numerous deformation paths to consider. To that end, we employ an edit-distance algorithm for shock graphs that finds the optimal deformation path in polynomial time. The proposed approach gives intuitive

Petrify: a tool for manipulating concurrent specifications and . . .

by Jordi Cortadella, et al.
"... Petrify is a tool for (1) manipulating concurrent specifications and (2) synthesis and optimization of asynchronous control circuits. Given a Petri Net (PN), a Signal Transition Graph (STG), or a Transition System (TS) 1 it (1) generates another PN or STG which is simpler than the original descripti ..."
Abstract - Cited by 219 (34 self) - Add to MetaCart
Petrify is a tool for (1) manipulating concurrent specifications and (2) synthesis and optimization of asynchronous control circuits. Given a Petri Net (PN), a Signal Transition Graph (STG), or a Transition System (TS) 1 it (1) generates another PN or STG which is simpler than the original

Recognition of Shapes by Editing Shock Graphs

by Thomas B. Sebastian, Philip N. Klein, Benjamin B. Kimia - In IEEE International Conference on Computer Vision , 2001
"... This paper presents a novel recognition framework which is based on matching shock graphs of 2D shape outlines, where the distance between two shapes is defined to be the cost of the least action path deforming one shape to another. Three key ideas render the implementation of this framework practic ..."
Abstract - Cited by 125 (7 self) - Add to MetaCart
as equivalent. Shock transitions are points along the deformation where the shock graph topology changes. Third, we employ a graph edit distance algorithm that searches in the space of all possible transition sequences and finds the globally optimal sequence in polynomial time. The effectiveness of the proposed

Bidirectionalizing Graph Transformations

by S. Hidaka, Z. Hu, K. Inaba, H. Kato, K. Matsuda, K. Nakano - SUBMITTED TO ICFP , 2010
"... Bidirectional transformations provide a novel mechanism for synchronizing and maintaining the consistency of information between input and output. Despite many promising results on bidirectional transformations, they are limited to the context of relational or XML (tree-like) databases. In this pape ..."
Abstract - Cited by 30 (19 self) - Add to MetaCart
. In this paper, we challenge the problem of bidirectional transformations in the context of graphs, by proposing a formal definition of a well-behaved bidirectional semantics for UnCAL, a graph algebra for the known UnQL graph query language. The key to our successful formalization is full utilization of both
Results 1 - 10 of 987