Sciweavers

2924 search results - page 183 / 585
» Lower Bounds in Distributed Computing
Sort
View
JMLR
2010
155views more  JMLR 2010»
15 years 1 months ago
Bayesian Gaussian Process Latent Variable Model
We introduce a variational inference framework for training the Gaussian process latent variable model and thus performing Bayesian nonlinear dimensionality reduction. This method...
Michalis Titsias, Neil D. Lawrence
FSTTCS
2004
Springer
16 years 10 days ago
Testing Geometric Convexity
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
Luis Rademacher, Santosh Vempala
CCR
2006
92views more  CCR 2006»
15 years 7 months ago
A cooperative uplink power control scheme for elastic data services in wireless CDMA systems
We consider the uplink power control problem in a single cell CDMA wireless data system. Each user specifies upper and lower QoS bounds. We formulate the considered problem as a g...
George Alyfantis, Stathes Hadjiefthymiades, Lazaro...
ICASSP
2011
IEEE
14 years 10 months ago
Adaptive frequency-domain biased estimation algorithms with automatic adjustment of shrinkage factors
In this work, we propose adaptive frequency-domain biased estimation algorithms with mechanisms to automatically adjust the shrinkage factors. The proposed estimation algorithms i...
Sheng Li, Rodrigo C. de Lamare, Martin Haardt
CIE
2009
Springer
16 years 1 months ago
Cutting Planes and the Parameter Cutwidth
We introduce the parameter cutwidth for the Cutting Planes (CP) system of Gomory and Chv´atal. We provide linear lower bounds on cutwidth for two simple polytopes. Considering CP ...
Stefan S. Dantchev, Barnaby Martin