Demo Data from EDBT 2026 / reviewers in the wild / expert
Georg Lindgren
dblp:86/2532
· DBLP profile ↗
4ranked-venue papers
3as first author
0since 2021 · last 1995
0000-0002-1442-4774ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 2 first-authorComputer networks · 1 · 1 first-author
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 |
Probabilistic and Bayesian machine learning · 100% | |
| Theoretical computer science
2 papers |
Information theory · 67% Mathematical optimization · 33% | |
| Computer networks
2 papers |
Physical-layer communications · 81% Network performance modeling · 19% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
hidden markov model |
0.0 | 1 | 1995 | Recursive estimation of parameters in Markov-modulated Poisson processes · IEEE Trans. Commun. 1995 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
parameter estimation |
0.0 | 1 | 1995 | Recursive estimation of parameters in Markov-modulated Poisson processes · IEEE Trans. Commun. 1995 |
Information theory › probability theory › stochastic processes › markov processes
hidden markov model |
0.0 | 1 | 1991 | Recursive estimation in mixture models with Markov regime · IEEE Trans. Inf. Theory 1991 |
Mathematical optimization
statistical estimation |
0.0 | 1 | 1991 | Recursive estimation in mixture models with Markov regime · IEEE Trans. Inf. Theory 1991 |
Physical-layer communications › modulation › demodulation
FM demodulation |
0.0 | 2 | 1984 | Shape and duration of clicks in modulated FM transmission · IEEE Trans. Inf. Theory 1984 On the shape and duration of FM-clicks · IEEE Trans. Inf. Theory 1983 |
Physical-layer communications
signal processing for communications |
0.0 | 2 | 1984 | Shape and duration of clicks in modulated FM transmission · IEEE Trans. Inf. Theory 1984 On the shape and duration of FM-clicks · IEEE Trans. Inf. Theory 1983 |
Information theory › probability theory › stochastic processes
point processes |
0.0 | 1 | 1995 | Recursive estimation of parameters in Markov-modulated Poisson processes · IEEE Trans. Commun. 1995 |
Information theory › probability theory › stochastic processes › point processes
poisson process |
0.0 | 1 | 1995 | Recursive estimation of parameters in Markov-modulated Poisson processes · IEEE Trans. Commun. 1995 |
Network performance modeling › stochastic processes
gaussian process |
0.0 | 1 | 1983 | On the shape and duration of FM-clicks · IEEE Trans. Inf. Theory 1983 |
Methods — techniques the papers use, named apart from their topics
recursive estimation · 0.0expectation-maximization · 0.0information matrix · 0.0stochastic process modeling · 0.0slepian model process · 0.0slepian model · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1995 | Recursive estimation of parameters in Markov-modulated Poisson processesabstractA hidden Markov regime is a Markov process that governs the time or space dependent distributions of an observed stochastic process. Recursive algorithms can be used to estimate parameters in mixed distributions governed by a Markov regime. The authors derive a recursive algorithm for estimation of parameters in a Markov-modulated Poisson process also called a Cox point process. By this the authors mean a doubly stochastic Poisson process with a time dependent intensity that can take on a finite number of different values. The intensity switches randomly between the possible values according to a Markov process. The authors consider two different ways to observe the Markov-modulated Poisson process: in the first model the observations consist of the observed time intervals between events, and in the second model they use the total number of events in successive intervals of fixed length. They derive an algorithm for recursive estimation of the Poisson intensities and the switch intensities between the two states and illustrate the algorithm in a simulation study. The estimates of the switch intensities are based on the observed conditional switch probabilities. Georg Lindgren, Ulla Holst |
IEEE Trans. Commun. | 1 |
| 1991 | Recursive estimation in mixture models with Markov regimeabstractA recursive algorithm is proposed for estimation of parameters in mixture models, where the observations are governed by a hidden Markov chain. The often badly conditioned information matrix is estimated, and its inverse is incorporated into the algorithm. The performance of the algorithm is studied by simulations of a symmetric normal mixture. The algorithm seems to be stable and produce approximately normally distributed estimates, provided the adaptive matrix is kept well conditioned. Some numerical examples are included.> Ulla Holst, Georg Lindgren |
IEEE Trans. Inf. Theory | 2 |
| 1984 | Shape and duration of clicks in modulated FM transmissionabstractA Slepian model is derived for the shape of dicks in modulated FM transmission. The modulated signal may be a deterministic periodic function or a stationary stochastic process, not necessarily Gaussian. To describe the clicks one first derives the stochastic properties of noise and signal at the clicks. (For a periodic signal this amounts to giving the relative number of clicks in any given part of the period.) Then the conditional distributions of noise and signal near clicks are derived in explicit form, using the noise and signal values at the click as (random) parameters, and finally these conditional distributions are mixed into a total model for the click shapes. For increasing carrier-to-noise power ratioA^{2}/2, the Slepian model converges after normalization to a rational function with random coefficients. The amplitude of a click is shown to be of the orderA^{2}, in contrast to the unmodulated ease, where click amplitudes are of the orderA. Georg Lindgren |
IEEE Trans. Inf. Theory | 1 |
| 1983 | On the shape and duration of FM-clicksabstractThe stochastic behavior of FM-clicks in an unmodulated carrier plus noise is studied in terms of the conditional behavior of stationary Gaussian processes after level crossings. By a systematic use of thc Slepian model processes it is shown that the normalized shape of a positive FM-click approaches a certain rational function with simple random coefficients as the carrier-to-noise ratio tends to infinity. The outcomes of this random function illustrate the typical click shapes that have been observed experimentally. The distribution of the duration of a click is studied by means of similar model processes, and its exact asymptotic density is derived. It is seen to be very similar to a Maxwell density, although of smaller order for large durations. Georg Lindgren |
IEEE Trans. Inf. Theory | 1 |