Publications related to MATHICSE Technical Report : Frequency-domain non-intrusive greedy Model Order Reduction based on minimal rational approximation

Sparse Group Covers and Greedy Tree Approximations

We consider the problem of finding a K-sparse approximation of a signal, such that the support of the approximation is the union of sets from a given collection, a.k.a. group structure. This problem subsumes the one of finding K-sparse tree approximations. ...

2015

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Jan Sickmann Hesthaven, Benjamin Stamm

We propose two new and enhanced algorithms for greedy sampling of high- dimensional functions. While the techniques have a substantial degree of generality, we frame the discussion in the context of methods for empirical interpolation and the devel- opment ...

EDP Sciences2014

Near-optimal Sensor Placement for Signals lying in a Union of Subspaces

Martin Vetterli, Juri Ranieri, Dalia Salem Hassan Fahmy El Badawy

Sensor networks are commonly deployed to measure data from the environment and accurately estimate certain parameters. However, the number of deployed sensors is often limited by several constraints, such as their cost. Therefore, their locations must be o ...

2014

Optimal Classification In Sparse Gaussian Graphic Model

Zhigang Yao, Yingying Fan

Consider a two-class classification problem where the number of features is much larger than the sample size. The features are masked by Gaussian noise with mean zero and covariance matrix Sigma, where the precision matrix Omega = Sigma(-1) is unknown but ...

Institute of Mathematical Statistics2013

Threshold Saturation in Spatially Coupled Constraint Satisfaction Problems

Rüdiger Urbanke, Nicolas Macris, Seyed Hamed Hassani

We consider chains of random constraint satisfaction models that are spatially coupled across a finite window along the chain direction. We investigate their phase diagram at zero temperature using the survey propagation formalism and the interpolation met ...

Springer Verlag2013

Chebyshev interpolation for nonlinear eigenvalue problems

Daniel Kressner, Peter Cedric Effenberger

This work is concerned with numerical methods for matrix eigenvalue problems that are nonlinear in the eigenvalue parameter. In particular, we focus on eigenvalue problems for which the evaluation of the matrix-valued function is computationally expensive. ...

Springer Netherlands2012

SCOOP: A Real-Time Sparsity Driven People Localization Algorithm

Pierre Vandergheynst, Alexandre Massoud Alahi, Mohammad Golbabaee

Detecting and tracking people in scenes monitored by cameras is an important step in many application scenarios such as surveillance, urban planning or behavioral studies to name a few. The amount of data produced by camera feeds is so large that it is als ...

Springer Verlag2012

Recursive Implementation of the Distributed Karhunen-Loeve Transform

Michael Christoph Gastpar

In the distributed linear source coding problem, a set of distributed sensors observe subsets of a data vector with noise, and provide the fusion center linearly encoded data. The goal is to determine the encoding matrix of each sensor such that the fusion ...

2010

A Greedy Approach To The Distributed Karhunen-Loeve Transform

Michael Christoph Gastpar

In the distributed linear source coding problem a set of distributed sensors observe subsets of a data vector, and provide the fusion center with linearly encoded data. The goal is to determine the encoding matrix of each sensor such that the fusion center ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

The potential to improve the choice: list conflict-free coloring for geometric hypergraphs

Shakhar Smorodinsky

Given a geometric hypergraph (or a range-space)

H=(V,\cal E)

, a coloring of its vertices is said to be conflict-free if for every hyperedge

S \in \cal E

there is at least one vertex in

S

whose color is distinct from the colors of all other vertices i ...

2010

MATHICSE Technical Report : Frequency-domain non-intrusive greedy Model Order Reduction based on minimal rational approximation

Graph Chatbot

Chat with Graph Search

Sparse Group Covers and Greedy Tree Approximations

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Near-optimal Sensor Placement for Signals lying in a Union of Subspaces

Optimal Classification In Sparse Gaussian Graphic Model

Threshold Saturation in Spatially Coupled Constraint Satisfaction Problems

Chebyshev interpolation for nonlinear eigenvalue problems

SCOOP: A Real-Time Sparsity Driven People Localization Algorithm

Recursive Implementation of the Distributed Karhunen-Loeve Transform

A Greedy Approach To The Distributed Karhunen-Loeve Transform

The potential to improve the choice: list conflict-free coloring for geometric hypergraphs

SCOOP: A Real-Time Sparsity Driven People Localization Algorithm

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Near-optimal Sensor Placement for Signals lying in a Union of Subspaces

Optimal Classification In Sparse Gaussian Graphic Model

Threshold Saturation in Spatially Coupled Constraint Satisfaction Problems

Sparse Group Covers and Greedy Tree Approximations

Recursive Implementation of the Distributed Karhunen-Loeve Transform

The potential to improve the choice: list conflict-free coloring for geometric hypergraphs

A Greedy Approach To The Distributed Karhunen-Loeve Transform

Chebyshev interpolation for nonlinear eigenvalue problems