Sciweavers

220 search results - page 14 / 44
» Reconstruction Algorithm for Permutation Graphs
Sort
View
CEC
2007
IEEE
14 years 1 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
SCAM
2005
IEEE
14 years 1 months ago
Control Flow Graph Reconstruction for Assembly Language Programs with Delayed Instructions
Most software for embedded systems, including digital signal processing systems, is coded in assembly language. For both understanding the software and for reverse compiling it to...
Nerina Bermudo, Andreas Krall, R. Nigel Horspool
ICIP
2006
IEEE
14 years 9 months ago
Virtual Craniofacial Reconstruction from Computed Tomography Image Sequences Exhibiting Multiple Fractures
A novel procedure for in-silico (virtual) craniofacial reconstruction of human mandibles with multiple fractures from a sequence of Computed Tomography (CT) images is presented. T...
Ananda S. Chowdhury, Suchendra M. Bhandarkar, Robe...
ICML
2008
IEEE
14 years 8 months ago
The skew spectrum of graphs
The central issue in representing graphstructured data instances in learning algorithms is designing features which are invariant to permuting the numbering of the vertices. We pr...
Risi Imre Kondor, Karsten M. Borgwardt
FCT
2005
Springer
14 years 1 months ago
Reconstructing Many Partitions Using Spectral Techniques
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
Joachim Giesen, Dieter Mitsche