Sciweavers

4432 search results - page 622 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
TOC
2008
122views more  TOC 2008»
15 years 3 months ago
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
Avi Wigderson, David Xiao
CORR
2002
Springer
159views Education» more  CORR 2002»
15 years 2 months ago
Complexity of Mechanism Design
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism de...
Vincent Conitzer, Tuomas Sandholm
INFOCOM
2010
IEEE
15 years 1 months ago
Truthful Least-Priced-Path Routing in Opportunistic Spectrum Access Networks
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
Tao Shu, Marwan Krunz
JMLR
2010
149views more  JMLR 2010»
14 years 10 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
SIAMIS
2010
167views more  SIAMIS 2010»
14 years 9 months ago
Global Solutions of Variational Models with Convex Regularization
Abstract. We propose an algorithmic framework for computing global solutions of variational models with convex regularity terms that permit quite arbitrary data terms. While the mi...
Thomas Pock, Daniel Cremers, Horst Bischof, Antoni...