activity
20162023
most citedGeneralization Bounds for Sparse Random Feature Expansions

35 citations · 107 across the 26 of their papers we have counts for

collaborators
Showing 2018Show all

5 papers · 1 filter

cs.CV2018★ 17 cited

Evolutionary Self-Expressive Models for Subspace Clustering

Abolfazl Hashemi, Haris Vikalo

The problem of organizing data that evolves over time into clusters is encountered in a number of practical settings. We introduce evolutionary subspace clustering, a method whose…

eess.SP2018

Randomized Greedy Sensor Selection: Leveraging Weak Submodularity

Abolfazl Hashemi, Mahsa Ghasemi, Haris Vikalo +1

We study the problem of estimating a random process from the observations collected by a network of sensors that operate under resource constraints. When the dynamics of the proces…

eess.SP2018

Near-Optimal Distributed Estimation for a Network of Sensing Units Operating Under Communication Constraints

Abolfazl Hashemi, Osman Fatih Kilic, Haris Vikalo

We study the problem of distributed state estimation in a network of sensing units that can exchange their measurements but the rate of communication between the units is constrain…

eess.SP2018

A Novel Scheme for Support Identification and Iterative Sampling of Bandlimited Graph Signals

Abolfazl Hashemi, Rasoul Shafipour, Haris Vikalo +1

We study the problem of sampling and reconstruction of bandlimited graph signals where the objective is to select a node subset of prescribed cardinality that ensures interpolation…

eess.SP2018

Towards Accelerated Greedy Sampling and Reconstruction of Bandlimited Graph Signals

Abolfazl Hashemi, Rasoul Shafipour, Haris Vikalo +1

We study the problem of sampling and reconstructing spectrally sparse graph signals where the objective is to select a subset of nodes of prespecified cardinality that ensures inte…