Sciweavers

70 search results - page 5 / 14
» Rapidly Exploring Application Design Through Speed Dating
Sort
View
79
Voted
DATE
2007
IEEE
167views Hardware» more  DATE 2007»
15 years 3 months ago
A decomposition-based constraint optimization approach for statically scheduling task graphs with communication delays to multip
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
Nadathur Satish, Kaushik Ravindran, Kurt Keutzer
ICMS
2010
14 years 8 months ago
The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra
There is a growing interest in numeric-algebraic techniques in the computer algebra community as such techniques can speed up many applications. This paper is concerned with one su...
Jihun Yu, Chee Yap, Zilin Du, Sylvain Pion, Herv&e...
78
Voted
SIGCOMM
2010
ACM
14 years 9 months ago
c-Through: part-time optics in data centers
Data-intensive applications that operate on large volumes of data have motivated a fresh look at the design of data center networks. The first wave of proposals focused on designi...
Guohui Wang, David G. Andersen, Michael Kaminsky, ...
CHI
2009
ACM
15 years 10 months ago
Wetpaint: scraping through multi-layered images
We introduce a technique for exploring multi-layered images by scraping arbitrary areas to determine meaningful relationships. Our system, called Wetpaint, uses perceptual depth c...
Hiroshi Ishii, Jürgen P. Schulze, Leonardo Bo...
79
Voted
SC
2009
ACM
15 years 2 months ago
A framework for core-level modeling and design of reconfigurable computing algorithms
Reconfigurable computing (RC) is rapidly becoming a vital technology for many applications, from high-performance computing to embedded systems. The inherent advantages of custom-...
Gongyu Wang, Greg Stitt, Herman Lam, Alan D. Georg...