Sciweavers

240 search results - page 32 / 48
» Nonconvex Robust Optimization for Problems with Constraints
Sort
View
CVPR
2011
IEEE
13 years 2 months ago
Accelerated Low-Rank Visual Recovery by Random Projection
Exact recovery from contaminated visual data plays an important role in various tasks. By assuming the observed data matrix as the addition of a low-rank matrix and a sparse matri...
Yadong Mu, Jian Dong, Xiaotong Yuan, Shuicheng Yan
INFOCOM
2012
IEEE
11 years 10 months ago
Spectrum management and power allocation in MIMO cognitive networks
Cognitive radio (CR) techniques improve the spectrum utilization by exploiting temporarily-free frequency bands (i.e., in the time domain). The spectrum utilization can be boosted...
Diep N. Nguyen, Marwan Krunz
JAIR
2008
104views more  JAIR 2008»
13 years 7 months ago
M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...
Adrian Petcu, Boi Faltings, David C. Parkes
MICCAI
2009
Springer
13 years 9 months ago
Optimal Graph Search Segmentation Using Arc-weighted Graph for Simultaneous Surface Detection of Bladder and Prostate
We present a novel method for globally optimal surface segmentation of multiple mutually interacting objects, incorporating both edge and shape knowledge in a 3-D graph-theoretic a...
Qi Song, Xiaodong Wu, Yunlong Liu, Mark Smith, Joh...
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 7 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin