Sciweavers

77 search results - page 9 / 16
» Asymptotic Resource Usage Bounds
Sort
View
PODS
2005
ACM
164views Database» more  PODS 2005»
15 years 12 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
INFOCOM
2010
IEEE
14 years 10 months ago
Queuing Analysis in Multichannel Cognitive Spectrum Access: A Large Deviation Approach
Abstract—The queueing performance of a (secondary) cognitive user is investigated for a hierarchical network where there are N independent and identical primary users. Each prima...
Amine Laourine, Shiyao Chen, Lang Tong
JHSN
2007
165views more  JHSN 2007»
14 years 11 months ago
Slack allocation techniques for intra-path load balancing
: Network resource provisioning techniques need to perform both inter-path and intra-path load balancing to maximize the network’s resource usage efficiency while supporting end...
Kartik Gopalan, Tzi-cker Chiueh, Yow-Jian Lin
ESOP
2009
Springer
15 years 6 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell
ICASSP
2011
IEEE
14 years 3 months ago
Capacity maximization for distributed beamforming in one- and bi-directional relay networks
In cooperative networks, users share their resources to establish reliable connections between each other. If two users want to communicate through a cooperative network, differen...
Adrian Schad, Alex B. Gershman, Shahram Shahbazpan...