Sciweavers

477 search results - page 49 / 96
» Algorithms for Non-negative Matrix Factorization
Sort
View
ECCV
2006
Springer
14 years 11 months ago
Incorporating Non-motion Cues into 3D Motion Segmentation
We address the problem of segmenting an image sequence into rigidly moving 3D objects. An elegant solution to this problem is the multibody factorization approach in which the mea...
Amit Gruber, Yair Weiss
FOCS
2008
IEEE
13 years 9 months ago
Matrix Sparsification for Rank and Determinant Computations via Nested Dissection
The nested dissection method developed by Lipton, Rose, and Tarjan is a seminal method for quickly performing Gaussian elimination of symmetric real positive definite matrices who...
Raphael Yuster
ISPD
2010
ACM
160views Hardware» more  ISPD 2010»
14 years 3 months ago
Physical synthesis of bus matrix for high bandwidth low power on-chip communications
As the thermal wall becomes the dominant factor limiting VLSI circuit performance, and the interconnect wires become the primary power consumer, power efficiency of onchip data th...
Renshen Wang, Evangeline F. Y. Young, Ronald L. Gr...
ICIP
1999
IEEE
14 years 10 months ago
A Fast Algorithm for Rigid Structure from Image Sequences
The factorization method [1] is a feature-based approach to recover 3D rigid structure from motion. In [2], we extended their framework to recover a parametric description of the ...
Pedro M. Q. Aguiar, José M. F. Moura
COCO
2009
Springer
119views Algorithms» more  COCO 2009»
14 years 3 months ago
An Approximation Algorithm for Approximation Rank
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
Troy Lee, Adi Shraibman