Sciweavers

424 search results - page 31 / 85
» Modelling and Evaluation of CCN-Caching Trees
Sort
View
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
14 years 2 months ago
Evaluating Branching Programs on Encrypted Data
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
Yuval Ishai, Anat Paskin
TPDS
2010
155views more  TPDS 2010»
13 years 7 months ago
Streamline: An Optimal Distribution Algorithm for Peer-to-Peer Real-Time Streaming
—In this paper we propose and evaluate an overlay distribution algorithm for P2P, chunk-based, streaming systems over forest-based topologies. In such systems, the stream is divi...
Giuseppe Bianchi, Nicola Blefari-Melazzi, Lorenzo ...
IPSN
2009
Springer
14 years 3 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
PSB
2003
13 years 10 months ago
Towards Identifying Lateral Gene Transfer Events
This paper is concerned with evaluating the performance of the model and algorithm in [7] for detecting lateral gene transfers events. Using a Poisson process to describe arrival t...
Louigi Addario-Berry, Michael T. Hallett, Jens Lag...
CC
2010
Springer
282views System Software» more  CC 2010»
13 years 7 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks