684 search results - page 47 / 137 » On embedding well-separable graphs |
137
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We introduce a new approach to take into account the memory architecture and the memory mapping in the High- Level Synthesis of Real-Time embedded systems. We formalize the memory...
110
click to vote
IPL
2008
15 years 4 months ago
2008
In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certai...
141
click to vote
TPHOL
2008
IEEE
15 years 10 months ago
2008
IEEE
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
111
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— In this paper a method for the fast determination of distortion-based optimal unequal error protection (UEP) of bitstreams generated by embedded image coders is described. The ...
125
click to vote
DATE
2008
IEEE
15 years 11 months ago
2008
IEEE
This work addresses the issue of design optimization for faulttolerant hard real-time systems. In particular, our focus is on the handling of transient faults using both checkpoin...