Sciweavers

1355 search results - page 133 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
PODS
2003
ACM
104views Database» more  PODS 2003»
14 years 9 months ago
Maintaining time-decaying stream aggregates
We formalize the problem of maintaining time-decaying aggregates and statistics of a data stream: the relative contribution of each data item to the aggregate is scaled down by a ...
Edith Cohen, Martin Strauss
HICSS
2006
IEEE
165views Biometrics» more  HICSS 2006»
14 years 3 months ago
Efficient Algorithms for Batch Re-Keying Operations in Secure Multicast
Secure multicast has a variety of applications in ecommerce, e-banking, command and control, video-ondemand, and other internet-based services. In this paper, we present algorithm...
Mohammad Hossain Heydari, Linda Morales, Ivan Hal ...
ICALP
2005
Springer
14 years 2 months ago
Dynamic Bin Packing of Unit Fractions Items
This paper studies the dynamic bin packing problem, in which items arrive and depart at arbitrary time. We want to pack a sequence of unit fractions items (i.e., items with sizes ...
Wun-Tat Chan, Tak Wah Lam, Prudence W. H. Wong
SWAT
1994
Springer
120views Algorithms» more  SWAT 1994»
14 years 1 months ago
Parallel Dynamic Lowest Common Ancestors
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
Erik Schenk
ECAI
2006
Springer
14 years 24 days ago
Modal Logics for Communicating Rule-Based Agents
In this paper, we show how to establish correctness and time bounds (e.g., quality of service guarantees) for multi-agent systems composed of communicating rule-based agents. The f...
Natasha Alechina, Mark Jago, Brian Logan