Sciweavers

1055 search results - page 211 / 211
» Enumerations in computable structure theory
Sort
View
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 4 months ago
Approximate Nash Equilibria under Stability Conditions
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
Maria-Florina Balcan, Mark Braverman
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 1 months ago
Fast global convergence of gradient methods for high-dimensional statistical recovery
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
MONET
2011
12 years 8 months ago
Distributed Coalition Formation Games for Secure Wireless Transmission
Cooperation among wireless nodes has been recently proposed for improving the physical layer (PHY) security of wireless transmission in the presence of multiple eavesdroppers. Whil...
Walid Saad, Zhu Han, Tamer Basar, Mérouane ...
CORR
2012
Springer
218views Education» more  CORR 2012»
12 years 1 months ago
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
Yaniv Plan, Roman Vershynin
ICTAC
2010
Springer
13 years 4 months ago
Preference and Non-deterministic Choice
Material Flow Abstraction of Manufacturing Systems. ‣Umberto Costa, Ivan de Medeiros Jr and Marcel Oliveira. Specification and Verification of a MPI Implementation for a MP-SoC...
Bill Stoddart, Frank Zeyda, Steve Dunne