Sciweavers

683 search results - page 88 / 137
» Randomized Data Structures for the Dynamic Closest-Pair Prob...
Sort
View
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
13 years 12 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
STACS
2007
Springer
14 years 2 months ago
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
Costas Busch, Srikanta Tirthapura
ATAL
2010
Springer
13 years 9 months ago
A graph-theoretic approach to protect static and moving targets from adversaries
The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack t...
John P. Dickerson, Gerardo I. Simari, V. S. Subrah...
ICDE
2007
IEEE
143views Database» more  ICDE 2007»
14 years 9 months ago
Hiding in the Crowd: Privacy Preservation on Evolving Streams through Correlation Tracking
We address the problem of preserving privacy in streams, which has received surprisingly limited attention. For static data, a well-studied and widely used approach is based on ra...
Feifei Li, Jimeng Sun, Spiros Papadimitriou, Georg...
DEXAW
2004
IEEE
166views Database» more  DEXAW 2004»
13 years 11 months ago
Development of Flexible Peer-To-Peer Information Systems Using Adaptable Mobile Agents
Wide-area networks provide an easy access to many different distributed and heterogeneous data sources. The development of automated operating tools is still complex, particularly...
Jean-Paul Arcangeli, Sebastien Leriche, Marc Pante...