Demo Data from VLDB 2026 / reviewers in the wild / expert
Mark Briers
dblp:07/578
· DBLP profile ↗
4ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 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 |
Probabilistic and Bayesian machine learning · 100% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods › sequential monte carlo
particle smoother |
0.1 | 1 | 2006 | Fast particle smoothing: if I had a million particles · ICML 2006 |
Methods — techniques the papers use, named apart from their topics
maximum a posteriori estimation · 0.1fast multipole method · 0.1dual tree recursion · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Efficient data structures for large scale tracking
Richard Oliver Lane, Mark Briers, T. M. Cooper, Simon Maskell |
FUSION | 2 |
| 2012 | Super-resolution in practice: the complete pipeline from image capture to super-resolved subimage creation using a novel frame selection method
Maria Petrou, Mohamed Hisham Jaward, Shengyong Chen, Mark Briers |
Mach. Vis. Appl. | 4 |
| 2006 | Fast particle smoothing: if I had a million particlesabstractWe propose efficient particle smoothing methods for generalized state-spaces models. Particle smoothing is an expensive O(N2) algorithm, where N is the number of particles. We overcome this problem by integrating dual tree recursions and fast multipole techniques with forward-backward smoothers, a new generalized two-filter smoother and a maximum a posteriori (MAP) smoother. Our experiments show that these improvements can substantially increase the practicality of particle smoothing. Mike Klaas, Mark Briers, Nando de Freitas, Arnaud Doucet, Simon Maskell, Dustin Lang |
ICML | 2 |
| 2005 | Bayesian visual tracking with existence processabstractMost object tracking approaches either assume that the number of objects is constant, or that information about object existence is provided by some external source. Here, we show how object existence can be rigorously integrated within the Bayesian single and multiple object tracking framework. We provide a general treatment that impacts as little as possible on existing tracking algorithms, so that software can be reused, and that allows implementation with Kalman filters, extended Kalman filters, particle filters, etc. We apply the proposed framework to colour-based tracking of multiple objects. Jaco Vermaak, Simon Maskell, Mark Briers, Patrick Pérez |
ICIP (1) | 3 |