Sciweavers

341 search results - page 19 / 69
» Redundancy elimination revisited
Sort
View
TSP
2010
13 years 3 months ago
Welch method revisited: nonparametric power spectrum estimation via circular overlap
The objective of this paper is twofold. The first part provides further insight in the statistical properties of the Welch power spectrum estimator. A major drawback of the Welch m...
Kurt Barbé, Rik Pintelon, Johan Schoukens
ESOP
2012
Springer
12 years 4 months ago
The Call-by-Need Lambda Calculus, Revisited
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
Stephen Chang, Matthias Felleisen
WWW
2007
ACM
14 years 9 months ago
Efficient search in large textual collections with redundancy
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...
Jiangong Zhang, Torsten Suel
CCS
2009
ACM
14 years 3 months ago
ShadowWalker: peer-to-peer anonymous communication using redundant structured topologies
Peer-to-peer approaches to anonymous communication promise to eliminate the scalability concerns and central vulnerability points of current networks such as Tor. However, the P2P...
Prateek Mittal, Nikita Borisov
USENIX
1996
13 years 10 months ago
AFRAID - A Frequently Redundant Array of Independent Disks
Disk arrays are commonly designed to ensure that stored data will always be able to withstand a disk failure, but meeting this goal comes at a significant cost in performance. We ...
Stefan Savage, John Wilkes