Sciweavers

385 search results - page 69 / 77
» Communication with Contextual Uncertainty
Sort
View
PVLDB
2010
152views more  PVLDB 2010»
13 years 9 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 8 months ago
Scheduling with Rate Adaptation under Incomplete Knowledge of Channel/Estimator Statistics
In time-varying wireless networks, the states of the communication channels are subject to random variations, and hence need to be estimated for efficient rate adaptation and sched...
Wenzhuo Ouyang, Sugumar Murugesan, Atilla Eryilmaz...
TIT
2011
119views more  TIT 2011»
13 years 5 months ago
Redundancy-Related Bounds for Generalized Huffman Codes
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
Michael B. Baer
MAGS
2010
153views more  MAGS 2010»
13 years 5 months ago
Designing bidding strategies in sequential auctions for risk averse agents
Designing efficient bidding strategies for sequential auctions remains an important, open problem area in agent-mediated electronic markets. In existing literature, a variety of bi...
Valentin Robu, Han La Poutré
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 11 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes