Sciweavers

189 search results - page 38 / 38
» Shortest Paths Without a Map
Sort
View
IPPS
2005
IEEE
14 years 1 months ago
Reducing Power with Performance Constraints for Parallel Sparse Applications
Sparse and irregular computations constitute a large fraction of applications in the data-intensive scientific domain. While every effort is made to balance the computational wor...
Guangyu Chen, Konrad Malkowski, Mahmut T. Kandemir...
LISA
2000
13 years 9 months ago
Tracing Anonymous Packets to Their Approximate Source
Most denial-of-service attacks are characterized by a flood of packets with random, apparently valid source addresses. These addresses are spoofed, created by a malicious program ...
Hal Burch, Bill Cheswick
INTEGRATION
2006
82views more  INTEGRATION 2006»
13 years 7 months ago
On whitespace and stability in physical synthesis
In the context of physical synthesis, large-scale standard-cell placement algorithms must facilitate incremental changes to layout, both local and global. In particular, flexible ...
Saurabh N. Adya, Igor L. Markov, Paul G. Villarrub...
TOG
2002
153views more  TOG 2002»
13 years 7 months ago
Interactive global illumination in dynamic scenes
In this paper, we present a system for interactive computation of global illumination in dynamic scenes. Our system uses a novel scheme for caching the results of a high quality p...
Parag Tole, Fabio Pellacini, Bruce Walter, Donald ...