230 search results - page 3 / 46 » Experiments with Improved Approximate Mean Value Analysis Al... |
108
Voted
CORR
2011
Springer
14 years 1 months ago
2011
Springer
We analyze and improve low rank representation (LRR), the state-of-the-art algorithm for subspace segmentation of data. We prove that for the noiseless case, the optimization mode...
86
Voted
SWAT
1994
Springer
15 years 1 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
BMCBI
2008
14 years 9 months ago
2008
Background: It is an important pre-processing step to accurately estimate missing values in microarray data, because complete datasets are required in numerous expression profile ...
103
click to vote
MFCS
2009
Springer
15 years 2 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
CSB
2003
IEEE
15 years 2 months ago
2003
IEEE
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...