17760 search results - page 380 / 3552 » A Generalization of the Massey-Ding Algorithm |
182
click to vote
KDD
2006
ACM
16 years 8 months ago
2006
ACM
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
177
click to vote
KDD
2004
ACM
16 years 8 months ago
2004
ACM
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
197
Voted
KDD
2001
ACM
16 years 8 months ago
2001
ACM
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
220
Voted
STOC
2006
ACM
16 years 7 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
195
Voted
ALT
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...