2127 search results - page 38 / 426 » Computing large matchings fast |
159
Voted
VIS
2003
IEEE
16 years 4 months ago
2003
IEEE
In this paper, we present a space efficient algorithm for speeding up isosurface extraction. Even though there exist algorithms that can achieve optimal search performance to iden...
250
click to vote
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
182
Voted
BMCBI
2011
14 years 7 months ago
2011
Background: The secondary structure of RNA molecules is intimately related to their function and often more conserved than the sequence. Hence, the important task of searching dat...
149
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
113
click to vote
ICPADS
2005
IEEE
15 years 9 months ago
2005
IEEE
: Accurate reconstruction of phylogenetic trees very often involves solving hard optimization problems, particularly the maximum parsimony (MP) and maximum likelihood (ML) problems...