173 search results - page 11 / 35 » Uncovering elements of style |
ESA
2004
Springer
15 years 3 months ago
2004
Springer
We introduce a new stable minimum storage algorithm for merging that needs O(m log( n m + 1)) element comparisons, where m and n are the sizes of the input sequences with m ≤ n. ...
ALMOB
2006
14 years 9 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
EWSA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Modern systems are heterogeneous, geographically distributed and highly dynamic since the communication topology can vary and the components can, at any moment, connect t...
ECSCW
1997
14 years 11 months ago
1997
Abstract: In field studies designed to uncover opportunities for computationallyintensive business applications, we observed an interaction pattern we term "constellations&quo...
SDM
2011
SIAM
14 years 13 days ago
2011
SIAM
The biclustering, co-clustering, or subspace clustering problem involves simultaneously grouping the rows and columns of a data matrix to uncover biclusters or sub-matrices of the...