Sciweavers

785 search results - page 93 / 157
» Embedding a Forest in a Graph
Sort
View
136
Voted
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 11 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...
OTM
2007
Springer
15 years 10 months ago
Self-healing in Binomial Graph Networks
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases...
Thara Angskun, George Bosilca, Jack Dongarra
SCAM
2005
IEEE
15 years 9 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
STACS
2007
Springer
15 years 10 months ago
Hard Metrics from Cayley Graphs of Abelian Groups
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur Ω(logn) multiplicative distortion, which is as large as it can possib...
Ilan Newman, Yuri Rabinovich
ISSS
2002
IEEE
120views Hardware» more  ISSS 2002»
15 years 9 months ago
Virtual Synchronization for Fast Distributed Cosimulation of Dataflow Task Graphs
Fast distributed cosimulation is a challenging problem for the embedded system design. The main theme of this paper is to increase simulation speed by reducing the frequency of in...
Soonhoi Ha, Sungchan Kim, Chan-Eun Rhee, Hyunguk J...