Sciweavers

2996 search results - page 333 / 600
» Numberings and Randomness
Sort
View
PIMRC
2010
IEEE
15 years 4 months ago
How to improve the performance in Delay Tolerant Networks under Manhattan Mobility Model
Delay Tolerant networks (DTNs) are one type of wireless networks where the number of nodes per unit area is small and hence the connectivity between the nodes is intermittent. In t...
Mouna Abdelmoumen, Eya Dhib, Mounir Frikha, Tijani...
SOCIALCOM
2010
15 years 4 months ago
Estimating the Size of Online Social Networks
The huge size of online social networks (OSNs) makes it prohibitively expensive to precisely measure any properties which require the knowledge of the entire graph. To estimate the...
Shaozhi Ye, Shyhtsun Felix Wu
CORR
2010
Springer
179views Education» more  CORR 2010»
15 years 4 months ago
Algebraic Constructions of Graph-Based Nested Codes from Protographs
Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence ...
Christine A. Kelley, Jörg Kliewer
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 4 months ago
The Stability of Low-Rank Matrix Reconstruction: a Constrained Singular Value View
The stability of low-rank matrix reconstruction is investigated in this paper. The -constrained minimal singular value ( -CMSV) of the measurement operator is shown to determine t...
Gongguo Tang, Arye Nehorai
CORR
2010
Springer
117views Education» more  CORR 2010»
15 years 4 months ago
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
Amit Chakrabarti, Oded Regev