Sciweavers

125 search results - page 14 / 25
» A Recursive Embedding Approach to Median Graph Computation
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
Graph commute times for image representation
We introduce a new image representation that encompasses both the general layout of groups of quantized local invariant descriptors as well as their relative frequency. A graph of...
Nikos Paragios, Regis Behmo, Véronique Prin...
CVPR
2007
IEEE
14 years 9 months ago
Fiber Tract Clustering on Manifolds With Dual Rooted-Graphs
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
Andy Tsai, Carl-Fredrik Westin, Alfred O. Hero, Al...
RTCSA
2000
IEEE
14 years 5 days ago
Extracting safe and precise control flow from binaries
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
Henrik Theiling
GG
2004
Springer
14 years 1 months ago
Generating Test Cases for Code Generators by Unfolding Graph Transformation Systems
Abstract. Code generators are widely used in the development of embedded software to automatically generate executable code from graphical specifications. However, at present, cod...
Paolo Baldan, Barbara König, Ingo Stürme...
DAC
2009
ACM
14 years 2 months ago
Information hiding for trusted system design
For a computing system to be trusted, it is equally important to verify that the system performs no more and no less functionalities than desired. Traditional testing and verifica...
Junjun Gu, Gang Qu, Qiang Zhou