Sciweavers

5169 search results - page 398 / 1034
» Locality approximation using time
Sort
View
DAC
2006
ACM
16 years 25 days ago
A fast on-chip decoupling capacitance budgeting algorithm using macromodeling and linear programming
We propose a novel and efficient charge-based decoupling capacitance budgeting algorithm. Our method uses the macromodeling technique and effective radius of decoupling capacitan...
Min Zhao, Rajendran Panda, Savithri Sundareswaran,...
WSCG
2004
189views more  WSCG 2004»
15 years 8 months ago
Hardware Accelerated Soft Shadows using Penumbra Quads
Shadow mapping is a commonly used technique for generating hard shadows in real time. However, existing shadow map based algorithms cannot render full soft shadows penumbras onto ...
Jukka Arvo, Jan Westerholm
PODC
2000
ACM
15 years 10 months ago
Efficient atomic broadcast using deterministic merge
We present an approach for merging message streams from producers distributed over a network, using a deterministic algorithm that is independent of any nondeterminism of the syst...
Marcos Kawazoe Aguilera, Robert E. Strom
COMGEO
2004
ACM
15 years 6 months ago
On simplifying dot maps
Dot maps--drawings of point sets--are a well known cartographic method to visualize density functions over an area. We study the problem of simplifying a given dot map: given a se...
Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat ...
SAINT
2008
IEEE
16 years 1 months ago
Dynamic Relay Node Placement in Wireless Sensor Networks
In this paper we present an online algorithm that attacks the problem of placing relay nodes in regions where high localized congestion is detected. Congestion refers to the netwo...
Jorge Mena, Vana Kalogeraki