150 search results - page 3 / 30 » Fast Unimodular Counting |
KDD
1998
ACM
13 years 11 months ago
1998
ACM
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
CASES
2004
ACM
14 years 29 days ago
2004
ACM
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
ISLPED
2006
ACM
14 years 1 months ago
2006
ACM
—An increasing number of architectural techniques rely on hardware counting bloom filters (CBFs) to improve upon the enegy, delay and complexity of various processor structures. ...
AIPS
2006
13 years 9 months ago
2006
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Per-flow network measurement at Internet backbone links requires the efficient maintanence of large arrays of statistics counters at very high speeds (e.g. 40 Gb/s). The prevailin...