Randomized Single-View Algorithms for Low-Rank Matrix Approximation
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
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 ...
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. ...
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 ...
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 ...
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 ...
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 ...
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 ...
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
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 ...
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 ...
