Sciweavers

24 search results - page 5 / 5
» A spectral algorithm for envelope reduction of sparse matric...
Sort
View
CORR
2011
Springer
198views Education» more  CORR 2011»
13 years 2 months ago
Kron Reduction of Graphs with Applications to Electrical Networks
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
Florian Dörfler, Francesco Bullo
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
12 years 7 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
CVPR
2006
IEEE
14 years 9 months ago
A Closed Form Solution to Natural Image Matting
Interactive digital matting, the process of extracting a foreground object from an image based on limited user input, is an important task in image and video editing. From a compu...
Anat Levin, Dani Lischinski, Yair Weiss
NIPS
2007
13 years 8 months ago
People Tracking with the Laplacian Eigenmaps Latent Variable Model
Reliably recovering 3D human pose from monocular video requires models that bias the estimates towards typical human poses and motions. We construct priors for people tracking usi...
Zhengdong Lu, Miguel Á. Carreira-Perpi&ntil...