Sciweavers

150 search results - page 6 / 30
» Counting Results in Weak Formalisms
Sort
View
RTSS
2005
IEEE
16 years 6 days ago
Event Count Automata: A State-Based Model for Stream Processing Systems
Recently there has been a growing interest in models and methods targeted towards the (co)design of stream processing applications; e.g. those for audio/video processing. Streams ...
Samarjit Chakraborty, Linh T. X. Phan, P. S. Thiag...
SOFSEM
2009
Springer
16 years 3 months ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
Martin Dietzfelbinger, Ulf Schellbach
SODA
2003
ACM
167views Algorithms» more  SODA 2003»
15 years 8 months ago
Counting inversions in lists
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...
Anupam Gupta, Francis Zane
PODS
2010
ACM
306views Database» more  PODS 2010»
15 years 11 months ago
Optimizing linear counting queries under differential privacy
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answe...
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Mikla...
ASWEC
2006
IEEE
16 years 21 days ago
Formally Analysing a Security Protocol for Replay Attacks
The Kerberos-One-Time protocol is a key distribution protocol promoted for use with Javacards to provide secure communication over the GSM mobile phone network. From inspection we...
Benjamin W. Long, Colin J. Fidge