Sciweavers

1170 search results - page 139 / 234
» How Fast Is Too Fast
Sort
View
ICALP
2009
Springer
16 years 3 months ago
A Distributed and Oblivious Heap
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
Christian Scheideler, Stefan Schmid
112
Voted
SIGMOD
2001
ACM
147views Database» more  SIGMOD 2001»
16 years 3 months ago
Optimizing Queries Using Materialized Views: A practical, scalable solution
Materialized views can provide massive improvements in query processing time, especially for aggregation queries over large tables. To realize this potential, the query optimizer ...
Jonathan Goldstein, Per-Åke Larson
159
Voted
IMA
2009
Springer
221views Cryptology» more  IMA 2009»
15 years 10 months ago
Cache Timing Analysis of LFSR-Based Stream Ciphers
Cache timing attacks are a class of side-channel attacks that is applicable against certain software implementations. They have generated significant interest when demonstrated ag...
Gregor Leander, Erik Zenner, Philip Hawkes
116
Voted
ICMCS
2007
IEEE
123views Multimedia» more  ICMCS 2007»
15 years 9 months ago
BOPPER: Wireless Video Broadcasting with Peer-to-Peer Error Recovery
Wireless digital video broadcasting has experienced much success in recent years with some industrial systems deployed. We study in this paper how to recover lost packets in video...
Shenjie Li, S.-H. Gary Chan
109
Voted
PG
2007
IEEE
15 years 9 months ago
Exact Evaluation of Non-Polynomial Subdivision Schemes at Rational Parameter Values
In this paper, we describe a method for exact evaluation of a limit mesh defined via subdivision on a uniform grid of any size. Other exact evaluation technique either restrict t...
Scott Schaefer, Joe D. Warren