Sciweavers

63 search results - page 11 / 13
» Theoretical Bounds and System Design for Multipinhole SPECT
Sort
View
FUIN
2006
139views more  FUIN 2006»
13 years 7 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
PDPTA
2007
13 years 9 months ago
A Parallel Algorithm for Discrete Gabor Transforms
- Serial algorithms to evaluate the Gabor transform of a discrete signal are bound by the length of signal for which the transform can be evaluated. The time taken, if machine memo...
Kshitij Sudan, Nipun Saggar, Asok De
FOCS
2007
IEEE
14 years 2 months ago
A Primal-Dual Randomized Algorithm for Weighted Paging
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
MONET
2008
135views more  MONET 2008»
13 years 7 months ago
Understanding the Power of Distributed Coordination for Dynamic Spectrum Management
This paper investigates a distributed and adaptive approach to manage spectrum usage in dynamic spectrum access networks. While previous works focus on centralized provisioning, w...
Lili Cao, Haitao Zheng
RTCSA
2003
IEEE
14 years 1 months ago
An Approximation Algorithm for Broadcast Scheduling in Heterogeneous Clusters
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...
Pangfeng Liu, Da-Wei Wang, Yi-Heng Guo