Pierre Brémaud

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

VLDB 2026 Research / reviewers in the wild / expert

dblp:69/5547 · DBLP profile ↗

← Back

5ranked-venue papers

5as first author

0since 2021 · last 2004

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-authorComputer networks · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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.

Computer architecture, parallel and distributed computing, and storage systems 1 paper		Performance modeling and evaluation · 100%
Theoretical computer science 1 paper		Mathematical optimization · 100%
Artificial intelligence 1 paper		Probabilistic and Bayesian machine learning · 100%
Computer networks 1 paper		Routing and switching · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

Topic	Papers	Last	Evidence papers
Performance modeling and evaluation › stochastic analysis perturbation analysis	1	1992	Derivatives of Likelihood Ratios and Smoothed Perturbation Analysis for the Routing Problem · SIGMETRICS 1992
Routing and switching adaptive routing	1	1992	Derivatives of Likelihood Ratios and Smoothed Perturbation Analysis for the Routing Problem · SIGMETRICS 1992
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes jump processes	1	1988	An averaging principle for filtering a jump process with point process observations · IEEE Trans. Inf. Theory 1988
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes markov processes	1	1988	An averaging principle for filtering a jump process with point process observations · IEEE Trans. Inf. Theory 1988

Methods — techniques the papers use, named apart from their topics

likelihood ratio method · 0.0gradient estimation · 0.0point process filtering · 0.0invariant distribution · 0.0

Year	Publication	Venue	Position
2004	Power spectra related to UWB communications abstract Power spectra of signals related to random spikes are of interest in communications. In the present paper, we give a closed form formula for the power spectrum of a random stream of spikes, where the positions of spikes form a renewal process and the sequence of amplitudes is a correlated time series. Pierre Brémaud, Andrea Ridolfi	ICC	1
2004	Power spectra of UWB time-hopping modulated signals: a shot noise approach abstract This paper presents a general method for obtaining the exact power spectra of generic time hopping modulated signals. Based on a point process approach, it provides simpler proofs for existing results and a powerful rigorous and at the same time systematic tool for computing the spectra of more complex time-hopping models. Spectrum formula are easy to understand and the contribution of each component of the model appears explicitly Pierre Brémaud, Andrea Ridolfi	ISIT	1
2002	Power spectral measure and reconstruction error of randomly sampled signals abstract We say that a signal is randomly sampled when the samples are taken at random instants of time. The study of random sampling and randomly sampled signals is motivated both by practical and theoretical interests. The first one includes spectral analysis (estimation of spectra from a finite number of samples) and quality of service (signal reconstruction), and the second one includes statistical analysis of reconstruction methods. The present paper focuses on the computation of the (theoretical) spectrum of randomly sampled signals and on the computation of the reconstruction error. Using a point process approach, we obtain general formulas for spatial random sampling, providing powerful tools for the analysis and the processing of randomly sampled signals. Pierre Brémaud, Andrea Ridolfi	ITW	1
1992	Derivatives of Likelihood Ratios and Smoothed Perturbation Analysis for the Routing Problem abstract We present stationary and regenerative form estimates for the gradients of the cycle variables with respect to a thinning parameter in the arrival process of G/G/1 queueing systems. Our estimates belong to the category of the likelihood ratio method (LRM) and smoothed perturbation analysis (SPA) estimates. The results are useful in adaptive routing design. Pierre Brémaud, Wei-Bo Gong	SIGMETRICS	1
1988	An averaging principle for filtering a jump process with point process observations abstract A proof of the following result is given. Le X/sub t/ and Y/sub t/ be two jump processes which modulate the intensity of a multivariate point process N/sub t/, and suppose that the process X/sub t/ is a fast' Markov chain with a unique invariant probability distribution. Then the filtering equations for Y/sub t/ can be obtained by considering, instead of the original problem, the averaged problem where the intensity is replaced by the averaged intensity.> Pierre Brémaud	IEEE Trans. Inf. Theory	1