Sciweavers

3378 search results - page 628 / 676
» Learning in Friedberg Numberings
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
Neighbor Discovery with Reception Status Feedback to Transmitters
—Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighb...
Ramin Khalili, Dennis Goeckel, Donald F. Towsley, ...
TIT
2008
105views more  TIT 2008»
15 years 4 months ago
State Discrimination With Post-Measurement Information
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
Manuel A. Ballester, Stephanie Wehner, Andreas Win...
SMC
2010
IEEE
186views Control Systems» more  SMC 2010»
15 years 4 months ago
Semantic enrichment of text representation with wikipedia for text classification
—Text classification is a widely studied topic in the area of machine learning. A number of techniques have been developed to represent and classify text documents. Most of the t...
Hiroki Yamakawa, Jing Peng, Anna Feldman
INFOCOM
2010
IEEE
15 years 4 months ago
Reliable Wireless Broadcasting with Near-Zero Feedback
We examine the problem of minimizing feedbacks in reliable wireless broadcasting, by pairing rateless coding with extreme value theory. Our key observation is that, in a broadcast ...
Weiyao Xiao, Sachin Agarwal, David Starobinski, Ar...
ASIACRYPT
2011
Springer
14 years 6 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer