Sciweavers

391 search results - page 17 / 79
» Structural and algorithmic issues of dynamic protocol update
Sort
View
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
11 years 9 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
AMR
2006
Springer
138views Multimedia» more  AMR 2006»
13 years 11 months ago
Fast Structuring of Large Television Streams Using Program Guides
An original task of structuring and labeling large television streams is tackled in this paper. Emphasis is put on simple and efficient methods to detect precise boundaries of prog...
Xavier Naturel, Guillaume Gravier, Patrick Gros
ICC
2007
IEEE
111views Communications» more  ICC 2007»
14 years 1 months ago
Scalable Maintenance for Strong Web Consistency in Dynamic Content Delivery Overlays
— Content Delivery Overlays improves end-user performance by replicating Web contents on a group of geographically distributed sites interconnected over the Internet. However, wi...
Zhou Su, Jiro Katto, Yasuhiko Yasuda
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 7 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
ARGMAS
2004
Springer
14 years 25 days ago
Negotiation Among DDeLP Agents
Negotiation can be conceived as the exchange of messages among self-interested agents in order to settle on an agreement over a given issue. They decide which messages to send acco...
Fernando A. Tohmé, Guillermo Ricardo Simari