Demo Data from SIGIR 2026 / reviewers in the wild / expert
Eran Dahan
dblp:144/6077
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2021
0009-0003-8806-9220ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Computer networks · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Face, body and person analysis · 44% Learning paradigms · 44% Transfer learning and domain adaptation · 13% | |
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Face, body and person analysis
kinship verification |
0.5 | 1 | 2021 | A Unified Approach to Kinship Verification · IEEE Trans. Pattern Anal. Mach. Intell. 2021 |
Machine learning › Learning paradigms › multi-task learning › multitask deep learning
multi-task deep networks |
0.5 | 1 | 2021 | A Unified Approach to Kinship Verification · IEEE Trans. Pattern Anal. Mach. Intell. 2021 |
Coding theory › source coding
multiterminal source coding |
0.2 | 1 | 2014 | Multi-Terminal Source Encoding with Side-Information Aided Encoder Breakdown · IEEE Trans. Commun. 2014 |
Coding theory › source coding
rate-distortion theory |
0.2 | 1 | 2014 | Multi-Terminal Source Encoding with Side-Information Aided Encoder Breakdown · IEEE Trans. Commun. 2014 |
Coding theory › source coding
side information |
0.2 | 1 | 2014 | Multi-Terminal Source Encoding with Side-Information Aided Encoder Breakdown · IEEE Trans. Commun. 2014 |
Machine learning › Transfer learning and domain adaptation
few-shot learning |
0.1 | 1 | 2021 | A Unified Approach to Kinship Verification · IEEE Trans. Pattern Anal. Mach. Intell. 2021 |
Methods — techniques the papers use, named apart from their topics
multi-task learning · 0.5embedding fusion · 0.5adaptive sampling · 0.5inner and outer bounds · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | A Unified Approach to Kinship VerificationabstractIn this work, we propose a deep learning-based approach for kin verification using a unified multi-task learning scheme where all kinship classes are jointly learned. This allows us to better utilize small training sets that are typical of kin verification. We introduce a novel approach for fusing the embeddings of kin images, to avoid overfitting, which is a common issue in training such networks. An adaptive sampling scheme is derived for the training set images, to resolve the inherent imbalance in kin verification datasets. A thorough ablation study exemplifies the effectivity of our approach, which is experimentally shown to outperform contemporary state-of-the-art kin verification results when applied to the Families In the Wild, FG2018, and FG2020 datasets. Eran Dahan, Yosi Keller |
IEEE Trans. Pattern Anal. Mach. Intell. | 1 |
| 2014 | Multi-Terminal Source Encoding with Side-Information Aided Encoder BreakdownabstractWe consider a problem which is an extension of the multi-terminal source coding problem with encoder breakdown studied by Berger-Yeung. In our problem when, and only when, encoder breakdown happens the decoder gets help from a third node in the form of side-information which is degraded with respect to the un-encoded source. Inner and outer bounds on the rate-distortion region are derived. The achievable region is tight when both source components are reconstructed losslessly at the non-breakdown scenario and partially tight when the distortion measures are degraded and deterministic. Our results also explain the missing sum-rate constraint in the characterization of the rate-distortion region of the Berger-Yeung problem. Shraga I. Bross, Eran Dahan |
IEEE Trans. Commun. | 2 |