Optimizing static and adaptive probing schedules for rapid event detection

DOI10.1016/j.tcs.2016.05.041zbMath1423.68458arXiv1509.02487OpenAlexW2570079387MaRDI QIDQ2424874

Ahmad Mahmoody, Eli Upfal, Evgenios M. Kornaropoulos

Publication date: 25 June 2019

Published in: Theoretical Computer Science, Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.02487

zbMATH Keywords

samplingapproximation algorithmrandomized algorithmprobabilistic methodevent detectionnovelty detection

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25) Randomized algorithms (68W20)

Uses Software

• OptiRisk
• TwitterMonitor

Cites Work

• Network Applications of Bloom Filters: A Survey
• Probability and Computing
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimizing static and adaptive probing schedules for rapid event detection