Sciweavers

207 search results - page 28 / 42
» Run-Time Switching Between Total Order Algorithms
Sort
View
TVCG
2011
274views more  TVCG 2011»
13 years 2 months ago
Memory-Scalable GPU Spatial Hierarchy Construction
We present two novel algorithms for constructing spatial hierarchies on GPUs. The first is for kd-trees that automatically balances between the level of parallelism and total mem...
Qiming Hou, Xin Sun, Kun Zhou, Christian Lauterbac...
HIPC
2003
Springer
14 years 19 days ago
Combined Scheduling of Hard and Soft Real-Time Tasks in Multiprocessor Systems
Many complex real-time applications involve combined scheduling of hard and soft real-time tasks. In this paper, we propose a combined scheduling algorithm, called Emergency Algori...
Basheer Al-Duwairi, Govindarasu Manimaran
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
13 years 8 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
VTC
2006
IEEE
175views Communications» more  VTC 2006»
14 years 1 months ago
On-Demand Channel Assignment Using Channel Segregation for Uplink DS-CDMA Multi-Hop Virtual Cellular Network
— In order to avoid the large peak transmit power, resulting from the high transmission rates expected for future mobile communication systems, a wireless multi-hop virtual cellu...
Lalla Soundous El Alami, Eisuke Kudoh, Fumiyuki Ad...
PVLDB
2011
12 years 10 months ago
An Incremental Hausdorff Distance Calculation Algorithm
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...
Sarana Nutanong, Edwin H. Jacox, Hanan Samet