activity
20102017
most citedPoint-hyperplane frameworks, slider joints, and rigidity preserving transformations

2 citations · 5 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2017★ 2 cited

Point-hyperplane frameworks, slider joints, and rigidity preserving transformations

Yaser Eftekhari, Bill Jackson, Anthony Nixon +3

A one-to-one correspondence between the infinitesimal motions of bar-joint frameworks in and those in is a classical observation by Pogorelov, and fur…

cs.NI2012

Locating Disruptions on Internet Paths through End-to-End Measurements

Atef Abdelkefi, Yaser Efthekhari, Yuming Jiang

In backbone networks carrying heavy traffic loads, unwanted and unusual end-to-end delay changes can happen, though possibly rarely. In order to understand and manage the network t…

cs.IT2012

Analysis and Design of Irregular Graphs for Node-Based Verification-Based Recovery Algorithms in Compressed Sensing

Yaser Eftekhari, Amir H. Banihashemi, Ioannis Lambadaris

In this paper, we present a probabilistic analysis of iterative node-based verification-based (NB-VB) recovery algorithms over irregular graphs in the context of compressed sensing…

cs.IT2011★ 1 cited

Density Evolution Analysis of Node-Based Verification-Based Algorithms in Compressive Sensing

Yaser Eftekhari, Anoosheh Heidarzadeh, Amir H. Banihashemi +1

In this paper, we present a new approach for the analysis of iterative node-based verification-based (NB-VB) recovery algorithms in the context of compressive sensing. These algori…

cs.IT2011

Density Evolution Analysis of Node-Based Verification-Based Algorithms in Compressed Sensing

Yaser Eftekhari, Anoosheh Heidarzadeh, Amir H. Banihashemi +1

In this paper, we present a new approach for the analysis of iterative node-based verification-based (NB-VB) recovery algorithms in the context of compressive sensing. These algori…

cs.IT2010★ 2 cited

An Efficient Approach Toward the Asymptotic Analysis of Node-Based Recovery Algorithms in Compressed Sensing

Yaser Eftekhari, Amir H. Banihashemi, Ioannis Lambadaris

In this paper, we propose a general framework for the asymptotic analysis of node-based verification-based algorithms. In our analysis we tend the signal length to infinity. We…