Sciweavers

1920 search results - page 27 / 384
» The Complexity of the A B C Problem
Sort
View
149
Voted
ESTIMEDIA
2009
Springer
16 years 12 days ago
System-level MP-SoC design space exploration using tree visualization
— The complexity of today’s embedded systems forces designers to model and simulate systems and their components to explore the wide range of design choices. Such design space ...
Toktam Taghavi, Andy D. Pimentel, Mark Thompson
ISCAS
2008
IEEE
110views Hardware» more  ISCAS 2008»
16 years 7 days ago
Non-traditional irregular interconnects for massive scale SoC
— By using self-assembling fabrication techniques at the cellular, molecular, or atomic scale, it is nowadays possible to create functional assemblies in a mainly bottom-up way t...
Christof Teuscher, Anders A. Hansson
PDPTA
2010
15 years 3 months ago
Disciplined Multi-core Programming in C
The problem of programmability on modern heterogeneous multicore and future manycore embedded platforms is still not solved satisfactorily: although many existing but incompatible ...
Pjotr Kourzanov, Orlando Moreira, Henk J. Sips
JMM2
2007
96views more  JMM2 2007»
15 years 5 months ago
A Framework for Linear Transform Approximation Using Orthogonal Basis Projection
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
Yinpeng Chen, Hari Sundaram
ORL
2008
66views more  ORL 2008»
15 years 5 months ago
Profit-based latency problems on the line
We consider a latency problem with a profit pi for each client. When serving a client, a revenue of pi -t is collected. The goal is to find routes for the servers such that total ...
Sofie Coene, Frits C. R. Spieksma