Sciweavers

909 search results - page 31 / 182
» Performance Evaluation of the VF Graph Matching Algorithm
Sort
View
LCPC
2005
Springer
15 years 6 months ago
Revisiting Graph Coloring Register Allocation: A Study of the Chaitin-Briggs and Callahan-Koblenz Algorithms
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant â...
Keith D. Cooper, Anshuman Dasgupta, Jason Eckhardt
ISCC
1999
IEEE
15 years 5 months ago
On Network Survivability Algorithms Based on Trellis Graph Transformations
Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network surviva...
Soulla Louca, Andreas Pitsillides, George Samaras
GECCO
2003
Springer
182views Optimization» more  GECCO 2003»
15 years 6 months ago
Modeling the Search Landscape of Metaheuristic Software Clustering Algorithms
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
Brian S. Mitchell, Spiros Mancoridis

Publication
200views
14 years 8 days ago
Tracking Endocardial Motion via Multiple Model Filtering of Distribution Cut
Tracking heart motion plays an essential role in the diagnosis of cardiovascular diseases. As such, accurate characterization of dynamic behavior of the left ventricle (LV) is esse...
Kumaradevan Punithakumar, Ismail Ben Ayed, Ali Isl...
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 1 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...