Sciweavers

526 search results - page 83 / 106
» On the Number of Minimal Addition Chains
Sort
View
IWMM
2011
Springer
254views Hardware» more  IWMM 2011»
14 years 17 days ago
Short-term memory for self-collecting mutators
We propose a new memory model called short-term memory for managing objects on the heap. In contrast to the traditional persistent memory model for heap management, objects in sho...
Martin Aigner, Andreas Haas, Christoph M. Kirsch, ...
WWW
2005
ACM
15 years 10 months ago
Hierarchical substring caching for efficient content distribution to low-bandwidth clients
While overall bandwidth in the internet has grown rapidly over the last few years, and an increasing number of clients enjoy broadband connectivity, many others still access the i...
Utku Irmak, Torsten Suel
ICC
2007
IEEE
15 years 4 months ago
Design of Single-Group Multicasting-Beamformers
— For the single-group multicast scenario, where K users are served with the same data by a base station equipped with N antennas, we present two beamforming algorithms which out...
Raphael Hunger, David A. Schmidt, Michael Joham, A...
TAMC
2007
Springer
15 years 3 months ago
Improving the Average Delay of Sorting
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Re...
CCR
2006
110views more  CCR 2006»
14 years 9 months ago
Estimating network proximity and latency
Network proximity and latency estimation is an important component in discovering and locating services and applications. With the growing number of services and service providers...
Puneet Sharma, Zhichen Xu, Sujata Banerjee, Sung-J...