Sciweavers

1153 search results - page 230 / 231
» Reversing graph transformations
Sort
View
JCB
2006
115views more  JCB 2006»
13 years 7 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
JIIS
2006
113views more  JIIS 2006»
13 years 7 months ago
Spatial ordering and encoding for geographic data mining and visualization
: Geographic information (e.g., locations, networks, and nearest neighbors) are unique and different from other aspatial attributes (e.g., population, sales, or income). It is a ch...
Diansheng Guo, Mark Gahegan
MST
2006
104views more  MST 2006»
13 years 7 months ago
Sequencing from Compomers: The Puzzle
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
Sebastian Böcker
VLC
2008
191views more  VLC 2008»
13 years 7 months ago
Visual specification of measurements and redesigns for domain specific visual languages
Ensuring model quality is a key success factor in many computer science areas, and becomes crucial in recent software engineering paradigms like the one proposed by model-driven s...
Esther Guerra, Juan de Lara, Paloma Díaz
ENTCS
2002
181views more  ENTCS 2002»
13 years 7 months ago
Alias verification for Fortran code optimization
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
Thi Viet Nga Nguyen, François Irigoin