output
20092021
most citedSoft-Decoding-Based Strategies for Relay and Interference Channels: Analysis and Achievable Rates Using LDPC Codes

25 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

6 papers

cs.CV2021★ 3 cited

Knowing When to Quit: Selective Cascaded Regression with Patch Attention for Real-Time Face Alignment

Gil Shapira, Noga Levy, Ishay Goldin +1

Facial landmarks (FLM) estimation is a critical component in many face-related applications. In this work, we aim to optimize for both accuracy and speed and explore the trade-off…

eess.SY2020★ 4 cited

Optimal Estimation of Capacity and Location of Wind, Solar and Fuel Cell Sources in Distribution Systems Considering Load Changes by Lightning Search Algorithm

Hassan Shokouhandeh, MahmoodReza Ghaharpour, Hamid Ghobadi Lamouki +3

In this paper, estimation of optimal capacity and location of installation of wind, solar and fuel cell sources in distribution systems to reduce loss and improve voltage profile,…

cs.AI2011★ 10 cited

Communication-Based Decomposition Mechanisms for Decentralized MDPs

Claudia V. Goldman, Shlomo Zilberstein

Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,…

cs.DM2011

On the Intersection of All Critical Sets of a Unicyclic Graph

Vadim E. Levit, Eugen Mandrescu

A set S is independent in a graph G if no two vertices from S are adjacent. The independence number alpha(G) is the cardinality of a maximum independent set, while mu(G) is the siz…

cs.IT2010★ 25 cited

Soft-Decoding-Based Strategies for Relay and Interference Channels: Analysis and Achievable Rates Using LDPC Codes

Amir Bennatan, Shlomo Shamai, A. Robert Calderbank

We provide a rigorous mathematical analysis of two communication strategies: soft decode-and-forward (soft-DF) for relay channels, and soft partial interference-cancelation (soft-I…

math.CO2009★ 2 cited

Critical independent sets and Konig--Egervary graphs

Vadim E. Levit, Eugen Mandrescu

Let alpha(G) be the cardinality of a independence set of maximum size in the graph G, while mu(G) is the size of a maximum matching. G is a Konig--Egervary graph if its order equal…