256 search results - page 50 / 52 » On a Generalized Notion of Mistake Bounds |
ICDT
2009
ACM
14 years 6 months ago
2009
ACM
In this paper, we present a comprehensive theoretical analysis of the sampling technique for the association rule mining problem. Most of the previous works have concentrated only...
STACS
2010
Springer
14 years 1 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
APPROX
2009
Springer
14 years 18 days ago
2009
Springer
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
ESA
2005
Springer
13 years 11 months ago
2005
Springer
Histograms are used in many ways in conventional databases and in data stream processing for summarizing massive data distributions. Previous work on constructing histograms on da...
EMSOFT
2004
Springer
13 years 11 months ago
2004
Springer
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...