2004 search results - page 256 / 401 » Sampling from large graphs |
139
click to vote
BMCBI
2007
15 years 2 months ago
2007
Background: With DNA microarray data, selecting a compact subset of discriminative genes from thousands of genes is a critical step for accurate classification of phenotypes for, ...
112
Voted
TSP
2010
14 years 9 months ago
2010
We address covariance estimation in the sense of minimum mean-squared error (MMSE) when the samples are Gaussian distributed. Specifically, we consider shrinkage methods which are ...
130
Voted
ICSM
2006
IEEE
15 years 8 months ago
2006
IEEE
Facts extracted from source code have been used to support a variety of software engineering activities, ranging from architectural understanding, through detection of design patt...
102
Voted
ICCV
2009
IEEE
16 years 7 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
153
Voted
CVPR
2004
IEEE
16 years 4 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...