Sciweavers

434 search results - page 73 / 87
» Monadic Bounded Algebras
Sort
View
ENTCS
2010
101views more  ENTCS 2010»
13 years 7 months ago
Strengthening the Zipper
The zipper is a well known design pattern for providing a cursor-like interface to a data structure. However, the classic treatise by Huet only scratches the surface of some of it...
Tristan O. R. Allwood, Susan Eisenbach
CORR
2011
Springer
135views Education» more  CORR 2011»
13 years 1 months ago
On the Limitations of Provenance for Queries With Difference
The annotation of the results of database transformations was shown to be very effective for various applications. Until recently, most works in this context focused on positive q...
Yael Amsterdamer, Daniel Deutch, Val Tannen
IACR
2011
149views more  IACR 2011»
12 years 9 months ago
Improved zero-sum distinguisher for full round Keccak-f permutation
Keccak is one of the five hash functions selected for the final round of the SHA-3 competition and its inner primitive is a permutation called Keccakf. In this paper, we find t...
Ming Duan, Xuejia Lai
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
14 years 11 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
STOC
2010
ACM
199views Algorithms» more  STOC 2010»
14 years 2 months ago
Zero-One Frequency Laws
Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMS...
Vladimir Braverman and Rafail Ostrovsky