Sciweavers

36 search results - page 7 / 8
» Solving convex programs by random walks
Sort
View
ICCAD
2007
IEEE
96views Hardware» more  ICCAD 2007»
14 years 3 months ago
Monte-Carlo driven stochastic optimization framework for handling fabrication variability
Increasing effects of fabrication variability have inspired a growing interest in statistical techniques for design optimization. In this work, we propose a Monte-Carlo driven sto...
Vishal Khandelwal, Ankur Srivastava
ICC
2008
IEEE
144views Communications» more  ICC 2008»
14 years 21 days ago
Delay-Minimal Transmission for Energy Constrained Wireless Communications
—We investigate the problem of minimizing the overall transmission delay of data packets in a single-user wireless communication system, where the transmitter has a fixed amount...
Jing Yang, Sennur Ulukus
TCOM
2010
92views more  TCOM 2010»
13 years 4 months ago
Detection of Gaussian constellations in MIMO systems under imperfect CSI
Abstract—This paper considers the problem of Gaussian symbols detection in MIMO systems in the presence of channel estimation errors. Under this framework we develop a computatio...
Ido Nevat, Gareth W. Peters, Jinhong Yuan
JMLR
2008
168views more  JMLR 2008»
13 years 6 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
13 years 11 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál