Sciweavers

2252 search results - page 439 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
FCCM
1999
IEEE
134views VLSI» more  FCCM 1999»
13 years 12 months ago
Runlength Compression Techniques for FPGA Configurations
The time it takes to reconfigure FPGAs can be a significant overhead for reconfigurable computing. In this paper we develop new compression algorithms for FPGA configurations that...
Scott Hauck, William D. Wilson
SIGGRAPH
1996
ACM
13 years 11 months ago
Interactive Multiresolution Surface Viewing
Multiresolution analysis has been proposed as a basic tool supporting compression, progressive transmission, and level-of-detail control of complex meshes in a unified and theoret...
Andrew Certain, Jovan Popovic, Tony DeRose, Tom Du...
TMI
2010
165views more  TMI 2010»
13 years 5 months ago
Spatio-Temporal Data Fusion for 3D+T Image Reconstruction in Cerebral Angiography
—This paper provides a framework for generating high resolution time sequences of 3D images that show the dynamics of cerebral blood flow. These sequences have the potential to ...
Andrew Copeland, Rami Mangoubi, Mukund N. Desai, S...
INFOCOM
2012
IEEE
11 years 10 months ago
CARPO: Correlation-aware power optimization in data center networks
—Power optimization has become a key challenge in the design of large-scale enterprise data centers. Existing research efforts focus mainly on computer servers to lower their ene...
Xiaodong Wang, Yanjun Yao, Xiaorui Wang, Kefa Lu, ...
PODC
2009
ACM
14 years 8 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...