3020 search results - page 20 / 604 » Optimal partition trees |
DAWAK
2004
Springer
15 years 5 months ago
2004
Springer
All methods of association rule mining require the frequent sets of items, that occur together sufficiently often to be the basis of potentially interesting rules, to be first com...
ICIP
2005
IEEE
16 years 1 months ago
2005
IEEE
A new approach to Variable Size Block Matching is proposed, based on the binary partitioning of blocks. If a particular block does not allow for accurate motion compensation, then...
ICPR
2006
IEEE
16 years 24 days ago
2006
IEEE
This paper presents a method to speed up support vector classification, especially important when data is highdimensional. Unlike previous approaches which focus on less support v...
KDD
1995
ACM
15 years 3 months ago
1995
ACM
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
119
click to vote
SODA
1992
ACM
15 years 26 days ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...