654 search results - page 119 / 131 » Matrix Graph Grammars |
79
Voted
ICCV
2005
IEEE
16 years 1 months ago
2005
IEEE
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
MICCAI
2008
Springer
16 years 25 days ago
2008
Springer
We propose to measure quantitatively the opacity property of each pixel in a ground-glass opacity tumor from CT images. Our method results in an opacity map in which each pixel tak...
93
Voted
ICML
2009
IEEE
16 years 14 days ago
2009
IEEE
Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised...
104
click to vote
ICML
2006
IEEE
16 years 14 days ago
2006
IEEE
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
109
Voted
ICML
2005
IEEE
16 years 14 days ago
2005
IEEE
Graph-based methods for semi-supervised learning have recently been shown to be promising for combining labeled and unlabeled data in classification problems. However, inference f...