17760 search results - page 67 / 3552 » A Generalization of the Massey-Ding Algorithm |
121
click to vote
KDD
2004
ACM
16 years 1 months ago
2004
ACM
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
108
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...
PAMI
2008
15 years 1 months ago
2008
Beyond conventional linear and kernel-based feature extraction, we present a more generalized formulation for feature extraction in this paper. Two representative algorithms using ...
130
click to vote
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
113
click to vote
ESOP
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...