Sciweavers

5793 search results - page 1072 / 1159
» Individual communication complexity
Sort
View
XMLSEC
2003
ACM
14 years 3 months ago
Access control of XML documents considering update operations
As a large quantity of information is presented in XML format on the Web, there are increasing demands for XML security. Until now, research on XML security has been focused on th...
Chung-Hwan Lim, Seog Park, Sang Hyuk Son
PODS
2010
ACM
232views Database» more  PODS 2010»
14 years 3 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
INFOCOM
2002
IEEE
14 years 3 months ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 3 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
MMB
2010
Springer
194views Communications» more  MMB 2010»
14 years 2 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
« Prev « First page 1072 / 1159 Last » Next »