2570 search results - page 99 / 514 » Fast Algorithms For The Computation Of Ranklets |
DAWAK
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We present an information-theoretic framework for mining dependencies between itemsets in binary data. The problem of closure-based redundancy in this context is theoreti...
ICMCS
2005
IEEE
15 years 3 months ago
2005
IEEE
Owing to the great computation complexity of the ME (motion estimation) in video coding, a lot of fast ME algorithms have been proposed in literature. Most of them are designed ba...
IMC
2010
ACM
14 years 8 months ago
2010
ACM
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
109
click to vote
STOC
2012
ACM
13 years 15 days ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
CVPR
2003
IEEE
16 years 3 days ago
2003
IEEE
This work explores a statistical basis for a process often described in computer vision: image segmentation by region merging following a particular order in the choice of regions...