Publications related to A Determinantal Identity for the Permanent of a Rank 2 Matrix

Practical Sketching Algorithms For Low-Rank Matrix Approximation

This paper describes a suite of algorithms for constructing low-rank approximations of an input matrix from a random linear image, or sketch, of the matrix. These methods can preserve structural properties of the input matrix, such as positive-semidefinite ...

Society for Industrial and Applied Mathematics2017

Functional data analysis by matrix completion

Marie-Hélène Descary

Traditional approaches to analysing functional data typically follow a two-step procedure, consisting in first smoothing and then carrying out a functional principal component analysis. The idea underlying this procedure is that functional data are well ap ...

EPFL2017

Simplified Modal Expansion to Analyze Frequency-Selective Surfaces: An Equivalent Circuit Approach

Juan Ramon Mosig, Maria Garcia Vigueras

This communication extends a previously reported analytical circuit that models the plane wave scattering by 2-D arrays of planar patches/apertures embedded in a layered media. In this extension, it is assumed that the current/electric field spatial profil ...

Ieee-Inst Electrical Electronics Engineers Inc2016

A New Identity for the Least-square Solution of Overdetermined Set of Linear Equations

Afsaneh Asaei, Mohammadjavad Taghizadeh, Saeid Haghighatshoar

In this paper, we prove a new identity for the least-square solution of an over-determined set of linear equation

Ax=b

, where

A

is an

m\times n

full-rank matrix,

b

is a column-vector of dimension

m

, and

m

(the number of equations) is larger tha ...

2015

A New Identity for the Least-square Solution of Overdetermined Set of Linear Equations

Afsaneh Asaei, Mohammadjavad Taghizadeh, Saeid Haghighatshoar

In this paper, we prove a new identity for the least-square solution of an over-determined set of linear equation

Ax=b

, where

A

is an

m\times n

full-rank matrix,

b

is a column-vector of dimension

m

, and

m

(the number of equations) is larger tha ...

Idiap2015

Computing in social networks

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Andrei Giurgiu

This paper defines the problem of Scalable Secure computing in a Social network: we call it the S-3 problem. In short, nodes, directly reflecting on associated users, need to compute a symmetric function f : V-n -> U of their inputs in a set of constant si ...

Elsevier2014

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

LINVIEW: Incremental View Maintenance for Complex Analytical Queries

Christoph Koch, Milos Nikolic, Mohamed Elsayed Mohamed Ahmed El Seidy

Many analytics tasks and machine learning problems can be naturally expressed by iterative linear algebra programs. In this paper, we study the incremental view maintenance problem for such complex analytical queries. We develop a framework, called LINVIEW ...

2014

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

Establishing Trusted Identities

Rafik Chaabouni

Many online transactions require the sharing of identity information, even though this sharing poses substantial trust challenges, both for the sender and the receiver. For this reason, Internet must provide channels to ensure a secure, reliable, private, ...

2012

A Determinantal Identity for the Permanent of a Rank 2 Matrix

Graph Chatbot

Chat with Graph Search

Practical Sketching Algorithms For Low-Rank Matrix Approximation

Functional data analysis by matrix completion

Simplified Modal Expansion to Analyze Frequency-Selective Surfaces: An Equivalent Circuit Approach

A New Identity for the Least-square Solution of Overdetermined Set of Linear Equations

A New Identity for the Least-square Solution of Overdetermined Set of Linear Equations

Computing in social networks

Matrix Completion on Graphs

LINVIEW: Incremental View Maintenance for Complex Analytical Queries

Low-rank Matrix Approximation Using Point-wise Operators

Establishing Trusted Identities

Establishing Trusted Identities

Practical Sketching Algorithms For Low-Rank Matrix Approximation

A New Identity for the Least-square Solution of Overdetermined Set of Linear Equations

Functional data analysis by matrix completion

Simplified Modal Expansion to Analyze Frequency-Selective Surfaces: An Equivalent Circuit Approach

A New Identity for the Least-square Solution of Overdetermined Set of Linear Equations

Computing in social networks

Matrix Completion on Graphs

Low-rank Matrix Approximation Using Point-wise Operators

LINVIEW: Incremental View Maintenance for Complex Analytical Queries