Sciweavers

1477 search results - page 101 / 296
» Random Convex Programs
Sort
View
ICML
2009
IEEE
14 years 9 months ago
Learning structural SVMs with latent variables
We present a large-margin formulation and algorithm for structured output prediction that allows the use of latent variables. Our proposal covers a large range of application prob...
Chun-Nam John Yu, Thorsten Joachims
ICASSP
2009
IEEE
14 years 3 months ago
Distributed peer-to-peer beamforming for multiuser relay networks
A computationally efficient distributed beamforming technique for multi-user relay networks is developed. The channel state information is assumed to be known at the relays or de...
Haihua Chen, Alex B. Gershman, Shahram Shahbazpana...
ICC
2000
IEEE
105views Communications» more  ICC 2000»
14 years 1 months ago
FDMA Capacity of the Gaussian Multiple Access Channel With ISI
— This paper proposes a numerical method for characterizing the achievable rate region for a Gaussian multiple access channel with ISI under the frequency division multiple acces...
Wei Yu, John M. Cioffi
ENTCS
2007
104views more  ENTCS 2007»
13 years 8 months ago
Amb Breaks Well-Pointedness, Ground Amb Doesn't
McCarthy’s amb operator has no known denotational semantics, and its basic operational properties - the context lemma, the compatibility of refinement similarity and convex bis...
Paul Blain Levy
SIAMCOMP
2008
95views more  SIAMCOMP 2008»
13 years 8 months ago
On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model
Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. I...
Nir Halman