Publication

Randomized Single-View Algorithms for Low-Rank Matrix Approximation

Publications associées (53)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Purkinje Images: Conveying Different Content for Different Luminance Adaptations in a Single Image

Mahmut Sami Arpa

Providing multiple meanings in a single piece of art has always been intriguing to both artists and observers. We present Purkinje images, which have different interpretations depending on the luminance adaptation of the observer. Finding such images is an ...

Wiley-Blackwell2015

The computational structure of environmental life cycle costing

Vincent Moreau

Existing computational methods for life cycle costing (LCC) are few and appeared inconsistent with the very definition of LCC. This article improves the common matrix-based approach in life cycle assessment as applied to LCC, correcting previous errors. Re ...

Springer Heidelberg2015

Buckling of an elastic rod embedded on an elastomeric matrix: planar vs. non-planar configurations

Pedro Miguel Nunes Pereira de Almeida Reis, Jia Liu

We investigate the buckling of a slender rod embedded in a soft elastomeric matrix through a combination of experiments, numerics and theory. Depending on the control parameters, both planar wavy (2D) or non-planar coiled (3D) configurations are observed i ...

Royal Society of Chemistry2014

Matrix Completion on Graphs

Pierre Vandergheynst, Michael Bronstein, Xavier Bresson, Vasilis Kalofolias

The problem of finding the missing values of a matrix given a few of its entries, called matrix completion, has gathered a lot of attention in the recent years. Although the problem is NP-hard, Candes and Recht showed that it can be exactly relaxed if the ...

2014

Rectangular waveguides for applications using terahertz signals

Alessandro Macor, Mathieu Billod

A waveguide for transmitting signals at terahertz (THz) frequencies, wherein said waveguide comprises at least a matrix and an insert piece having a waveguide channel, wherein said piece is inserted in said matrix. ...

2014

Low-Rank Matrix Completion By Riemannian Optimization

The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over the Riemannian ma ...

Siam Publications2013

Optimizing over the Growing Spectrahedron

Martin Jaggi

We devise a framework for computing an approximate solution path for an important class of parameterized semidefinite problems that is guaranteed to be ε-close to the exact solution path. The problem of computing the entire regularization path for matrix f ...

Springer Berlin Heidelberg2012

Low-rank Matrix Approximation Using Point-wise Operators

Arash Amini, Amin Karbasi

Extracting low dimensional structure from high dimensional data arises in many applications such as machine learning, statistical pattern recognition, wireless sensor networks, and data compression. If the data is restricted to a lower dimensional subspace ...

Institute of Electrical and Electronics Engineers2012

Tg-aprotinin fusion proteins and matrices thereof

Peter Frey, Jeffrey Alan Hubbell, Kristen Lorentz

Fusion proteins containing a first domain and a second domain, where the first domain contains a crosslinkable substrate domain and the second domain contains a fibrinolysis inhibitor, are provided. In a preferred embodiment, the fibrinolysis inhibitor is ...

2011

Finite Rate of Innovation sampling techniques for embedded UWB devices.

Yann Barbotin

This report studies the applicability of Finite Rate of Innovation (FRI) algorithms to UltraWide Band (UWB) communications, more precisely in the scope of Low Power Body Area Networks (LP-BAN ). Three main issues are studied and given proposed solutions. F ...

2009