6358 search results - page 77 / 1272 » Computing spectral sequences |
140
Voted
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
Background: Although both conservation and correlated mutation (CM) are important information reflecting the different sorts of context in multiple sequence alignment, most of ali...
131
Voted
SAC
2010
ACM
15 years 3 months ago
2010
ACM
Next Generation Sequencing machines are generating millions of short DNA sequences (reads) everyday. There is a need for efficient algorithms to map these sequences to the referen...
149
click to vote
GFKL
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
153
Voted
IWCMC
2010
ACM
15 years 8 months ago
2010
ACM
—Analysis and modeling of wireless networks greatly depend on understanding the structure of underlying mobile nodes. In this paper we present two clustering algorithms to determ...
122
Voted
ICMLA
2008
15 years 5 months ago
2008
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...