Sciweavers

453 search results - page 91 / 91
» Tight bounds for the partial-sums problem
Sort
View
DKE
2008
79views more  DKE 2008»
13 years 7 months ago
Extracting k most important groups from data efficiently
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
Man Lung Yiu, Nikos Mamoulis, Vagelis Hristidis
JCST
2008
175views more  JCST 2008»
13 years 7 months ago
Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...
Hong Shen, Yu Zhang
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