Sciweavers

18090 search results - page 560 / 3618
» Computing by Only Observing
Sort
View
CORR
2011
Springer
155views Education» more  CORR 2011»
15 years 2 months ago
Subexponential convergence for information aggregation on regular trees
— We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k ≥ 2, we ...
Yashodhan Kanoria, Andrea Montanari
JSAC
2011
159views more  JSAC 2011»
15 years 2 months ago
An Anti-Jamming Stochastic Game for Cognitive Radio Networks
—Various spectrum management schemes have been proposed in recent years to improve the spectrum utilization in cognitive radio networks. However, few of them have considered the ...
Beibei Wang, Yongle Wu, K. J. Ray Liu, T. Charles ...
LOGCOM
2010
128views more  LOGCOM 2010»
15 years 1 months ago
Comparing LTL Semantics for Runtime Verification
When monitoring a system wrt. a property defined in a temporal logic such as LTL, a major concern is to settle with an adequate interpretation of observable system events; that is,...
Andreas Bauer 0002, Martin Leucker, Christian Scha...
SIGKDD
2010
151views more  SIGKDD 2010»
15 years 1 months ago
Limitations of matrix completion via trace norm minimization
In recent years, compressive sensing attracts intensive attentions in the field of statistics, automatic control, data mining and machine learning. It assumes the sparsity of the ...
Xiaoxiao Shi, Philip S. Yu
CORR
2011
Springer
161views Education» more  CORR 2011»
14 years 10 months ago
Doubly Robust Policy Evaluation and Learning
We study decision making in environments where the reward is only partially observed, but can be modeled as a function of an action and an observed context. This setting, known as...
Miroslav Dudík, John Langford, Lihong Li