Sciweavers

1690 search results - page 160 / 338
» Algorithmic Properties of Millstream Systems
Sort
View
SAC
2003
ACM
15 years 10 months ago
Broadcast Program Generation for Unordered Queries with Data Replication
We study in this paper the problem of broadcasting dependent data for unordered queries. However, most prior studies on dependent data broadcasting are limited to the premise of n...
Jiun-Long Huang, Ming-Syan Chen
COLCOM
2009
IEEE
15 years 9 months ago
Still alive: Extending keep-alive intervals in P2P overlay networks
Abstract—Nodes within existing P2P networks typically exchange periodic keep-alive messages in order to maintain network connections between neighbours. This paper investigates a...
Richard Price, Peter Tiño
VLDB
2010
ACM
144views Database» more  VLDB 2010»
15 years 3 months ago
Methods for finding frequent items in data streams
The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...
Graham Cormode, Marios Hadjieleftheriou
164
Voted
MOBIHOC
2010
ACM
15 years 2 months ago
Data preservation under spatial failures in sensor networks
In this paper, we address the problem of preserving generated data in a sensor network in case of node failures. We focus on the type of node failures that have explicit spatial s...
Navid Hamed Azimi, Himanshu Gupta, Xiaoxiao Hou, J...
AAECC
2008
Springer
101views Algorithms» more  AAECC 2008»
15 years 4 months ago
In search of mathematical primitives for deriving universal projective hash families
We provide some guidelines for deriving new projective hash families of cryptographic interest. Our main building blocks are so called group action systems; we explore what propert...
Maria Isabel Gonzalez Vasco, Jorge Luis Villar