Sciweavers

122 search results - page 17 / 25
» Reducing the Storage Requirements of a Perfect Hash Function
Sort
View
NSDI
2004
13 years 8 months ago
Designing a DHT for Low Latency and High Throughput
Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solution...
Frank Dabek, Jinyang Li, Emil Sit, James Robertson...
RT
1998
Springer
13 years 11 months ago
A New Change of Variables for Efficient BRDF Representation
We describe an idea for making decomposition of Bidirectional Reflectance Distribution Functions into basis functions more efficient, by performing a change-of-variables transform...
Szymon Rusinkiewicz
CN
2007
133views more  CN 2007»
13 years 7 months ago
Automatic high-performance reconstruction and recovery
Self-protecting systems require the ability to instantaneously detect malicious activity at run-time and prevent execution. We argue that it is impossible to perfectly self-protec...
Ashvin Goel, Wu-chang Feng, Wu-chi Feng, David Mai...
KDD
1999
ACM
206views Data Mining» more  KDD 1999»
13 years 11 months ago
Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
Jayavel Shanmugasundaram, Usama M. Fayyad, Paul S....
CISC
2005
Springer
169views Cryptology» more  CISC 2005»
14 years 28 days ago
On Bluetooth Repairing: Key Agreement Based on Symmetric-Key Cryptography
Abstract. Despite many good (secure) key agreement protocols based on publickey cryptography exist, secure associations between two wireless devices are often established using sym...
Serge Vaudenay