An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters
DOI10.1016/J.EJOR.2016.01.042zbMATH Open1346.94058OpenAlexW2283826724MaRDI QIDQ323016FDOQ323016
Authors: Alexei Vernitski, Laura Carrea, Xinan Yang 
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://centaur.reading.ac.uk/53947/1/YangVernitskiCarrea-revision2_AV_18012016.pdf
Recommendations
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Dynamic programming (90C39) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Space/time trade-offs in hash coding with allowable errors
- Approximate Dynamic Programming
- Dynamic programming and optimal control. Vol. 2
- An approximate dynamic programming approach to multidimensional knapsack problems
- The multidimensional 0-1 knapsack problem: an overview.
- An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system
- Optimizing data popularity conscious Bloom filters
- Solving the top-percentile traffic routing problem by approximate dynamic programming
- Less hashing, same performance: Building a better Bloom filter
- Using the Power of Two Choices to Improve Bloom Filters
- Title not available (Why is that?)
- Approximate dynamic programming with Bézier curves/surfaces for top-percentile traffic routing
- Network Applications of Bloom Filters: A Survey
- Title not available (Why is that?)
Uses Software
This page was built for publication: An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323016)
