Sciweavers

15 search results - page 3 / 3
» Limits on the Efficiency of One-Way Permutation-Based Hash F...
Sort
View
ICNP
1997
IEEE
13 years 10 months ago
TCP behavior with many flows
TCP's ability to share a bottleneck fairly and efficiently decreases as the number of competing flows increases. This effect starts to appear when there are more flows than p...
Robert Morris
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
14 years 5 months ago
Map-reduce-merge: simplified relational data processing on large clusters
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...
ICCAD
2005
IEEE
141views Hardware» more  ICCAD 2005»
14 years 2 months ago
Architecture and compilation for data bandwidth improvement in configurable embedded processors
Many commercially available embedded processors are capable of extending their base instruction set for a specific domain of applications. While steady progress has been made in t...
Jason Cong, Guoling Han, Zhiru Zhang
PE
2000
Springer
118views Optimization» more  PE 2000»
13 years 5 months ago
A probabilistic dynamic technique for the distributed generation of very large state spaces
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
William J. Knottenbelt, Peter G. Harrison, Mark Me...
WWW
2004
ACM
14 years 6 months ago
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network
Centralized Resource Description Framework (RDF) repositories have limitations both in their failure tolerance and in their scalability. Existing Peer-to-Peer (P2P) RDF repositori...
Min Cai, Martin R. Frank