616 search results - page 116 / 124 » Minimum Spanning Tree Based Clustering Algorithms |
109
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
171
Voted
APBC
2004
15 years 4 months ago
2004
This paper introduces a novel method for minimum number of gene (feature) selection for a classification problem based on gene expression data with an objective function to maximi...
128
Voted
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
Resource limitations in wireless sensor networks have put stringent constraints on distributed signal processing. In this paper, we propose a cluster-based decentralized variation...
139
Voted
ACCV
2009
Springer
15 years 9 months ago
2009
Springer
We present a novel algorithm for unsupervised segmentation of natural images that harnesses the principle of minimum description length (MDL). Our method is based on observations ...
117
Voted
DAC
2003
ACM
16 years 3 months ago
2003
ACM
We present in this paper a multilevel floorplanning/placement framework based on the B*-tree representation, called MB*-tree, to handle the floorplanning and packing for large-sca...