18 search results - page 3 / 4 » Complexity analysis and speedup techniques for optimal buffe... |
STOC
2007
ACM
14 years 6 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
ESTIMEDIA
2006
Springer
13 years 9 months ago
2006
Springer
Nowadays, key characteristics of a processor's instruction set are only exploited in high-level languages by using inline assembly or compiler intrinsics. Inserting intrinsic...
SCOPES
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
EMSOFT
2007
Springer
14 years 5 days ago
2007
Springer
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...
EDBT
2006
ACM
14 years 6 months ago
2006
ACM
In [12] we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. In this demo we show how this architecture is le...