Sciweavers

151 search results - page 7 / 31
» Computing in Solvable Matrix Groups
Sort
View
MFCS
2005
Springer
14 years 3 months ago
Tight Approximability Results for the Maximum Solution Equation Problem over Zp
In the maximum solution equation problem a collection of equations are given over some algebraic structure. The objective is to find an assignment to the variables in the equation...
Fredrik Kuivinen
CVPR
2011
IEEE
13 years 5 months ago
Online Group-Structured Dictionary Learning
We develop a dictionary learning method which is (i) online, (ii) enables overlapping group structures with (iii) non-convex sparsity-inducing regularization and (iv) handles the ...
Zoltan Szabo, Barnabas Poczos, Andras Lorincz
COMPGEOM
2011
ACM
13 years 1 months ago
Zigzag persistent homology in matrix multiplication time
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
Nikola Milosavljevic, Dmitriy Morozov, Primoz Skra...
ICCV
2003
IEEE
14 years 11 months ago
Images as Bags of Pixels
We propose modeling images and related visual objects as bags of pixels or sets of vectors. For instance, gray scale images are modeled as a collection or bag of (X, Y, I) pixel v...
Tony Jebara
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
14 years 4 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson