Sciweavers

7891 search results - page 1294 / 1579
» Local Area Networking
Sort
View
164
Voted
IMC
2006
ACM
16 years 21 days ago
Rarest first and choke algorithms are enough
The performance of peer-to-peer file replication comes from its piece and peer selection strategies. Two such strategies have been introduced by the BitTorrent protocol: the rare...
Arnaud Legout, Guillaume Urvoy-Keller, Pietro Mich...
SENSYS
2004
ACM
16 years 5 days ago
Call and response: experiments in sampling the environment
Monitoring of environmental phenomena with embedded networked sensing confronts the challenges of both unpredictable variability in the spatial distribution of phenomena, coupled ...
Maxim A. Batalin, Mohammad H. Rahimi, Yan Yu, Duo ...
GLVLSI
2009
IEEE
126views VLSI» more  GLVLSI 2009»
15 years 10 months ago
An efficient cut enumeration for depth-optimum technology mapping for LUT-based FPGAs
Recent technology mappers for LUT based FPGAs employ cut enumeration. Although many cuts are often needed to nd good network, enumerating all cuts with large size consumes run-tim...
Taiga Takata, Yusuke Matsunaga
JSSPP
1995
Springer
15 years 10 months ago
The ANL/IBM SP Scheduling System
During the past ve years scientists discovered that modern UNIX workstations connected with ethernet and ber networks could provide enough computational performance to compete wit...
David A. Lifka
CCS
2008
ACM
15 years 8 months ago
Efficient security primitives derived from a secure aggregation algorithm
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...
Haowen Chan, Adrian Perrig
« Prev « First page 1294 / 1579 Last » Next »