Sciweavers

97 search results - page 11 / 20
» Separating systems and oriented graphs of diameter two
Sort
View
CL
2012
Springer
11 years 11 months ago
Object swapping challenges: An evaluation of imageSegment
In object-oriented systems, runtime memory is composed of an object graph in which objects refer to other objects. This graph of objects evolves while the system is running. Graph...
Mariano Martinez Peck, Noury Bouraqadi, Sté...
SERP
2004
13 years 9 months ago
Design and Evaluation of an Automated Aspect Mining Tool
Attention to aspect oriented programming (AOP) is rapidly growing as its benefits in large software system development and maintenance are increasingly recognized. However, existin...
David Shepherd, Emily Gibson, Lori L. Pollock
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
14 years 2 months ago
Graph Rewriting in Computational Origami
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 ...
Tetsuo Ida
JGAA
2007
124views more  JGAA 2007»
13 years 8 months ago
Energy Models for Graph Clustering
The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software syst...
Andreas Noack
CORR
2011
Springer
165views Education» more  CORR 2011»
12 years 12 months ago
Data Base Mappings and Theory of Sketches
In this paper we will present the two basic operations for database schemas used in database mapping systems (separation and Data Federation), and we will explain why the functoria...
Zoran Majkic