Sciweavers

188 search results - page 33 / 38
» Finding Best k Policies
Sort
View
PODS
2009
ACM
100views Database» more  PODS 2009»
14 years 10 months ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...
DASFAA
2003
IEEE
139views Database» more  DASFAA 2003»
14 years 3 months ago
Freshness-driven Adaptive Caching for Dynamic Content
With the wide availability of content delivery networks, many e-commerce Web applications utilize edge cache servers to cache and deliver dynamic contents at locations much closer...
Wen-Syan Li, Oliver Po, Wang-Pin Hsiung, K. Sel&cc...
ASPLOS
1992
ACM
14 years 1 months ago
Non-Volatile Memory for Fast, Reliable File Systems
Given the decreasing cost of non-volatile RAM (NVRAM), by the late 1990's it will be feasible for most workstations to include a megabyte or more of NVRAM, enabling the desig...
Mary Baker, Satoshi Asami, Etienne Deprit, John K....
AUSAI
2005
Springer
14 years 3 months ago
K-Optimal Pattern Discovery: An Efficient and Effective Approach to Exploratory Data Mining
Most data-mining techniques seek a single model that optimizes an objective function with respect to the data. In many real-world applications several models will equally optimize...
Geoffrey I. Webb
SIGSOFT
2004
ACM
14 years 10 months ago
Empirical evaluation of defect projection models for widely-deployed production software systems
Defect-occurrence projection is necessary for the development of methods to mitigate the risks of software defect occurrences. In this paper, we examine user-reported software def...
Paul Luo Li, Mary Shaw, James D. Herbsleb, Bonnie ...