1033 search results - page 76 / 207 » The Relative History Heuristic |
KDD
2001
ACM
16 years 8 days ago
2001
ACM
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
ICSE
2005
IEEE-ACM
15 years 12 months ago
2005
IEEE-ACM
AGENDA is a tool set for testing relational database applications. An earlier prototype was targeted to applications consisting of a single query and included components for popul...
SIGMOD
2005
ACM
16 years 1 days ago
2005
ACM
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
140
click to vote
WEA
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
102
click to vote
ISSTA
2009
ACM
15 years 6 months ago
2009
ACM
Code coverage is a common aid in the testing process. It is generally used for marking the source code segments that were executed and, more importantly, those that were not execu...