Sciweavers

1477 search results - page 187 / 296
» Random Convex Programs
Sort
View
JACM
2011
152views more  JACM 2011»
12 years 12 months ago
Robust principal component analysis?
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...
Emmanuel J. Candès, Xiaodong Li, Yi Ma, Joh...
TOG
2012
181views Communications» more  TOG 2012»
11 years 11 months ago
Soft body locomotion
We present a physically-based system to simulate and control the locomotion of soft body characters without skeletons. We use the finite element method to simulate the deformatio...
Jie Tan, Greg Turk, C. Karen Liu
CVPR
2012
IEEE
11 years 11 months ago
Compressive depth map acquisition using a single photon-counting detector: Parametric signal processing meets sparsity
Active range acquisition systems such as light detection and ranging (LIDAR) and time-of-flight (TOF) cameras achieve high depth resolution but suffer from poor spatial resolutio...
Andrea Colaco, Ahmed Kirmani, Gregory A. Howland, ...
WWW
2006
ACM
14 years 9 months ago
Detecting nepotistic links by language model disagreement
In this short note we demonstrate the applicability of hyperlink downweighting by means of language model disagreement. The method filters out hyperlinks with no relevance to the ...
András A. Benczúr, István B&i...
FOCS
2006
IEEE
14 years 3 months ago
Improved approximation algorithms for multidimensional bin packing problems
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko