2004 search results - page 96 / 401 » Sampling from large graphs |
128
click to vote
BMCBI
2004
15 years 2 months ago
2004
Background: One of the most time-consuming tasks after performing a gene expression experiment is the biological interpretation of the results by identifying physiologically impor...
107
click to vote
ICDM
2008
IEEE
15 years 9 months ago
2008
IEEE
When the number of labeled examples is limited, traditional supervised feature selection techniques often fail due to sample selection bias or unrepresentative sample problem. To ...
128
click to vote
MICCAI
2008
Springer
16 years 4 months ago
2008
Springer
Abstract. Graph-based algorithms have become increasingly popular for medical image segmentation. The fundamental process for each of these algorithms is to use the image content t...
116
click to vote
CG
2004
Springer
15 years 2 months ago
2004
Springer
nd maps are powerful abstractions. Their combination, Hierarchical Graph Maps, provide effective tools to process a graph that is too large to fit on the screen. They provide hier...
127
click to vote
COLT
2003
Springer
15 years 8 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...