Sciweavers

3608 search results - page 150 / 722
» computer 2011
Sort
View
EDBT
2011
ACM
281views Database» more  EDBT 2011»
14 years 7 months ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
14 years 7 months ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...
IJNSEC
2011
89views more  IJNSEC 2011»
14 years 10 months ago
A Novel Key Management Scheme for Dynamic Access Control in a Hierarchy
Shen and Chen proposed a novel key management scheme for dynamic access control in a hierarchy. In this article, the authors shall present an improved version of Shen and Chen’s...
Shiang-Feng Tzeng, Cheng-Chi Lee, Tzu-Chun Lin
ENTCS
2011
134views more  ENTCS 2011»
14 years 7 months ago
Idioms are Oblivious, Arrows are Meticulous, Monads are Promiscuous
We revisit the connection between three notions of computation: Moggi’s monads, Hughes’s arrows and McBride and Paterson’s idioms (also called applicative functors). We show...
Sam Lindley, Philip Wadler, Jeremy Yallop
EUROCRYPT
2011
Springer
14 years 7 months ago
Faster Explicit Formulas for Computing Pairings over Ordinary Curves
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
Diego F. Aranha, Koray Karabina, Patrick Longa, Ca...