Sciweavers

113 search results - page 20 / 23
» Safe-Zones for Monitoring Distributed Streams
Sort
View
EDBT
2009
ACM
144views Database» more  EDBT 2009»
13 years 11 months ago
Efficient maintenance techniques for views over active documents
Many Web applications are based on dynamic interactions between Web components exchanging flows of information. Such a situation arises for instance in mashup systems or when moni...
Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu
ICPP
2002
IEEE
14 years 13 days ago
A Selection Technique for Replicated Multicast Video Servers
Abstract— In this paper, we propose a selection technique for replicated multicast video streams from different servers. We assume that there exist replicated video servers, each...
Akihito Hiromori, Hirozumi Yamaguchi, Keiichi Yasu...
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 1 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
IMC
2006
ACM
14 years 1 months ago
Approximate fingerprinting to accelerate pattern matching
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
Ramaswamy Ramaswamy, Lukas Kencl, Gianluca Iannacc...
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
11 years 10 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang