Sciweavers

5316 search results - page 913 / 1064
» Which Search Problems Are Random
Sort
View
PODS
2009
ACM
112views Database» more  PODS 2009»
16 years 4 months ago
Optimal sampling from sliding windows
APPEARED IN ACM PODS-2009. A sliding windows model is an important case of the streaming model, where only the most "recent" elements remain active and the rest are disc...
Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniol...
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
16 years 4 months ago
Using ghost edges for classification in sparsely labeled networks
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
16 years 4 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
ICASSP
2008
IEEE
15 years 10 months ago
Secure wireless communications: Secret keys through multipath
Secure wireless communications is a challenging problem due to the shared nature of the wireless medium. Most existing security protocols apply cryptographic techniques for bit sc...
Akbar M. Sayeed, Adrian Perrig
WONS
2005
IEEE
15 years 9 months ago
Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks
—Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a euclidean plane. We assume that each ...
Alexander Kesselman, Dariusz R. Kowalski