EDBT 2026 Demo / reviewers in the wild / expert
Pankaj Bhambhani
dblp:15/1390
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 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.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Environmental and earth informatics · 100% | |
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Environmental and earth informatics
ecological monitoring |
0.4 | 1 | 2020 | Detecting and Tracking Communal Bird Roosts in Weather Radar Data · AAAI 2020 |
Coding theory › error-correcting codes
code construction |
0.1 | 1 | 2012 | Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal Codes · IEEE Trans. Inf. Theory 2012 |
Coding theory
optical CDMA |
0.1 | 1 | 2012 | Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal Codes · IEEE Trans. Inf. Theory 2012 |
Coding theory › sequences › sequence design
optical orthogonal codes |
0.1 | 1 | 2012 | Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal Codes · IEEE Trans. Inf. Theory 2012 |
Methods — techniques the papers use, named apart from their topics
latent variable model · 0.4EM algorithm · 0.4rational functions · 0.1johnson bound · 0.1finite field polynomials · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Detecting and Tracking Communal Bird Roosts in Weather Radar DataabstractThe US weather radar archive holds detailed information about biological phenomena in the atmosphere over the last 20 years. Communally roosting birds congregate in large numbers at nighttime roosting locations, and their morning exodus from the roost is often visible as a distinctive pattern in radar images. This paper describes a machine learning system to detect and track roost signatures in weather radar data. A significant challenge is that labels were collected opportunistically from previous research studies and there are systematic differences in labeling style. We contribute a latent-variable model and EM algorithm to learn a detection model together with models of labeling styles for individual annotators. By properly accounting for these variations we learn a significantly more accurate detector. The resulting system detects previously unknown roosting locations and provides comprehensive spatio-temporal data about roosts across the US. This data will provide biologists important information about the poorly understood phenomena of broad-scale habitat use and movements of communally roosting birds during the non-breeding season. Zezhou Cheng, Saadia Gabriel, Pankaj Bhambhani, Daniel Sheldon, Subhransu Maji, Andrew Laughlin, David Winkler |
AAAI | 3 |
| 2012 | Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal CodesabstractNine new two-dimensional Optical Orthogonal Codes (2-D OOCs) are presented here, all sharing the common feature of a code size that is much larger in relation to the number of time slots than those of constructions appearing previously in the literature. Each of these constructions is either optimal or asymptotically optimal with respect to either the original Johnson bound or else a nonbinary version of the Johnson bound introduced in this paper. The first five codes are constructed using polynomials over finite fields—the first construction is optimal while the remaining four are asymptotically optimal. The next two codes are constructed using rational functions in place of polynomials and these are asymptotically optimal. The last two codes, also asymptotically optimal, are constructed by composing two of the above codes with a constant weight binary code. Also presented is a three-dimensional Optical Orthogonal Code (3-D OOC) that exploits the polarization dimension. Finally, phase-encoded optical CDMA is considered and construction of two efficient codes are provided. Reza Omrani, Gagan Garg, P. Vijay Kumar, Petros Elia, Pankaj Bhambhani |
IEEE Trans. Inf. Theory | 5 |