2157 search results - page 120 / 432 » Binary ant algorithm |
132
click to vote
KDD
2007
ACM
16 years 29 days ago
2007
ACM
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
141
click to vote
PAMI
2011
14 years 7 months ago
2011
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
119
click to vote
PPOPP
2012
ACM
13 years 8 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
103
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect delet...
101
click to vote
ACTA
2006
15 years 19 days ago
2006
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...