Sciweavers

98 search results - page 20 / 20
» Approximate counting in bounded arithmetic
Sort
View
SIAMCOMP
2002
152views more  SIAMCOMP 2002»
13 years 7 months ago
Maintaining Stream Statistics over Sliding Windows
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev...
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
14 years 25 days ago
Dimension, Entropy Rates, and Compression
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
John M. Hitchcock, N. V. Vinodchandran
IOR
2010
75views more  IOR 2010»
13 years 5 months ago
Confronting Entrenched Insurgents
During counterinsurgency operations, government forces with superior …repower confront weaker lowsignature insurgents. Under what conditions should government (Blue) forces atta...
Edward H. Kaplan, Moshe Kress, Roberto Szechtman