Sciweavers

1550 search results - page 150 / 310
» Benchmarking for Graph Transformation
Sort
View
137
Voted
ICSM
2003
IEEE
15 years 8 months ago
Software Architecture Recovery based on Pattern Matching
This paper is a summary of the author’s thesis that presents a model and an environment for recovering the high level design of legacy software systems based on user defined ar...
Kamran Sartipi
CIVR
2006
Springer
139views Image Analysis» more  CIVR 2006»
15 years 7 months ago
Finding People Frequently Appearing in News
Abstract. We propose a graph based method to improve the performance of person queries in large news video collections. The method benefits from the multi-modal structure of videos...
Derya Ozkan, Pinar Duygulu
FOSSACS
2006
Springer
15 years 7 months ago
Register Allocation After Classical SSA Elimination is NP-Complete
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
Fernando Magno Quintão Pereira, Jens Palsbe...
EJC
2008
15 years 3 months ago
Eriksson's numbers game and finite Coxeter groups
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...
Robert G. Donnelly
JEC
2006
61views more  JEC 2006»
15 years 3 months ago
Time-constrained loop scheduling with minimal resources
Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha