Sciweavers

Share
ESA
2011
Springer
257views Algorithms» more  ESA 2011»
7 years 9 months ago
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks
We study and characterize social-aware forwarding protocols in opportunistic networks and we derive bounds on the expected message delivery time for two different routing protocol...
Josep Díaz, Alberto Marchetti-Spaccamela, D...
EUROCRYPT
2011
Springer
8 years 20 days ago
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Abstract. NTRUEncrypt, proposed in 1996 by Hostein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic perfor...
Damien Stehlé, Ron Steinfeld
TCOM
2010
114views more  TCOM 2010»
8 years 3 months ago
Achieving near-capacity performance on multiple-antenna channels with a simple concatenation scheme
This paper proposes a capacity-approaching, yet simple scheme for multi-input multiple-output (MIMO) channels. The proposed scheme is based on a concatenation of a mixture of short...
Nghi H. Tran, Tho Le-Ngoc, Tad Matsumoto, Ha H. Ng...
ALGORITHMICA
2004
125views more  ALGORITHMICA 2004»
8 years 9 months ago
Multidimensional Cube Packing
We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes and (an unlimited quantity of) d-dimensional unit-capacity cubes, called bins, fi...
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa...
TIT
2008
139views more  TIT 2008»
8 years 9 months ago
Asymptotic Optimality Theory for Decentralized Sequential Hypothesis Testing in Sensor Networks
The decentralized sequential hypothesis testing problem is studied in sensor networks, where a set of sensors receive independent observations and send summary messages to the fusi...
Yajun Mei
CORR
2008
Springer
94views Education» more  CORR 2008»
8 years 9 months ago
Robust Joint Source-Channel Coding for Delay-Limited Applications
In this paper, we consider the problem of robust joint source-channel coding over an additive white Gaussian noise channel. We propose a new scheme which achieves the optimal slope...
Mahmoud Taherzadeh, Amir K. Khandani
SODA
2008
ACM
83views Algorithms» more  SODA 2008»
8 years 10 months ago
Splay trees, Davenport-Schinzel sequences, and the deque conjecture
We introduce a new technique to bound the asymptotic performance of splay trees. The basic idea is to transcribe, in an indirect fashion, the rotations performed by the splay tree...
Seth Pettie
CLUSTER
2008
IEEE
9 years 3 months ago
Divisible load scheduling with improved asymptotic optimality
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
Reiji Suda
books