Sciweavers

    ICASSP
    2011
    IEEE
    168views Signal Processing» more  ICASSP 2011»
    Low-rank matrix completion with geometric performance guarantees
    12 years 8 months ago
    Low-rank matrix completion with geometric performance guarantees
    Download  mirlab.org
    —The low-rank matrix completion problem can be stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. There exist...
    Wei Dai, Ely Kerman, Olgica Milenkovic
    claim paper
    Read More »
    TIT
    2010
    130views Education» more  TIT 2010»
    The power of convex relaxation: near-optimal matrix completion
    12 years 11 months ago
    The power of convex relaxation: near-optimal matrix completion
    Download  www-stat.stanford.edu
    This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
    Emmanuel J. Candès, Terence Tao
    claim paper
    Read More »
    SIAMREV
    2010
    170views more  SIAMREV 2010»
    Network Properties Revealed through Matrix Functions
    12 years 11 months ago
    Network Properties Revealed through Matrix Functions
    Download  www.mathstat.strath.ac.uk
    The newly emerging field of Network Science deals with the tasks of modelling, comparing and summarizing large data sets that describe complex interactions. Because pairwise affin...
    Ernesto Estrada, Desmond J. Higham
    claim paper
    Read More »
    SIAMMAX
    2010
    164views more  SIAMMAX 2010»
    Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
    12 years 11 months ago
    Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
    Download  www.math.princeton.edu
    The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
    Amit Singer, Mihai Cucuringu
    claim paper
    Read More »
    SIAMMA
    2010
    103views more  SIAMMA 2010»
    Matrix Extension with Symmetry and Its Application to Symmetric Orthonormal Multiwavelets
    12 years 11 months ago
    Matrix Extension with Symmetry and Its Application to Symmetric Orthonormal Multiwavelets
    Download  www.math.ualberta.ca
    Let P be an r
    Bin Han, Xiaosheng Zhuang
    claim paper
    Read More »
    SIAMCOMP
    2010
    172views more  SIAMCOMP 2010»
    Deterministic Polynomial Time Algorithms for Matrix Completion Problems
    12 years 11 months ago
    Deterministic Polynomial Time Algorithms for Matrix Completion Problems
    Download  www.hausdorff-research-institute.uni-bonn.de
    We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
    Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
    claim paper
    Read More »
    JMLR
    2010
    147views more  JMLR 2010»
    Spectral Regularization Algorithms for Learning Large Incomplete Matrices
    12 years 11 months ago
    Spectral Regularization Algorithms for Learning Large Incomplete Matrices
    Download  jmlr.csail.mit.edu
    We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
    Rahul Mazumder, Trevor Hastie, Robert Tibshirani
    claim paper
    Read More »
    TCS
    2011
    210views Theoretical Computer Science» more  TCS 2011»
    Dynamic normal forms and dynamic characteristic polynomial
    12 years 11 months ago
    Dynamic normal forms and dynamic characteristic polynomial
    Download  www.daimi.au.dk
    Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
    Gudmund Skovbjerg Frandsen, Piotr Sankowski
    claim paper
    Read More »
    SIAMSC
    2011
    177views more  SIAMSC 2011»
    Computing f(A)b via Least Squares Polynomial Approximations
    12 years 11 months ago
    Computing f(A)b via Least Squares Polynomial Approximations
    Download  www.mcs.anl.gov
    Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
    Jie Chen, Mihai Anitescu, Yousef Saad
    claim paper
    Read More »
    SIAMJO
    2011
    309views Software Engineering» more  SIAMJO 2011»
    Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
    12 years 11 months ago
    Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
    Download  www.optimization-online.org
    Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
    Min Tao, Xiaoming Yuan
    claim paper
    Read More »
    123456789next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.