Sciweavers

866 search results - page 160 / 174
» Bidirectionalizing graph transformations
Sort
View
FTTCS
2006
132views more  FTTCS 2006»
14 years 11 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter
IANDC
2006
113views more  IANDC 2006»
14 years 11 months ago
Automata and fixed point logic: A coalgebraic perspective
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
Yde Venema
IJCV
2007
115views more  IJCV 2007»
14 years 11 months ago
Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
Andrea Torsello, Antonio Robles-Kelly, Edwin R. Ha...
INFORMATICALT
2007
127views more  INFORMATICALT 2007»
14 years 11 months ago
Composition of Loop Modules in the Structural Blanks Approach to Programming with Recurrences: A Task of Synthesis of Nested Loo
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
Vytautas Cyras
CGA
2000
14 years 11 months ago
Metamorphosis of Arbitrary Triangular Meshes
Recently, animations with deforming objects have been frequently used in various computer graphics applications. Metamorphosis (or morphing) of three-dimensional objects is one of...
Takashi Kanai, Hiromasa Suzuki, Fumihiko Kimura