2229 search results - page 203 / 446 » Comparative analysis of biclustering algorithms |
129
click to vote
ICPADS
2007
IEEE
15 years 7 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
105
Voted
IDA
2005
Springer
15 years 6 months ago
2005
Springer
With the invention of biotechnological high throughput methods like DNA microarrays and the analysis of the resulting huge amounts of biological data, clustering algorithms gain ne...
96
Voted
CPM
2007
Springer
15 years 4 months ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
136
click to vote
FCCM
2009
IEEE
15 years 4 months ago
2009
IEEE
Modern use of FPGAs as hardware accelerators involves the partial reconfiguration of hardware resources as the application executes. In this paper, we present a polynomial time al...
98
Voted
DAGSTUHL
2007
15 years 2 months ago
2007
We present a stationary iterative scheme for PageRank computation. The algorithm is based on a linear system formulation of the problem, uses inner/outer iterations, and amounts to...