2192 search results - page 36 / 439 » Algorithms for Challenging Motif Problems |
ICDM
2003
IEEE
2003
IEEE
Clustering of Time Series Subsequences is Meaningless: Implications for Previous and Future Research
14 years 1 months ago
Given the recent explosion of interest in streaming data and online algorithms, clustering of time series subsequences, extracted via a sliding window, has received much attention...
GCB
2004
Springer
13 years 11 months ago
2004
Springer
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...
ORL
2011
13 years 3 months ago
2011
Computing the 1-width of the incidence matrix of a Steiner Triple System gives rise to small set covering instances that provide a computational challenge for integer programming ...
ECCV
2006
Springer
14 years 10 months ago
2006
Springer
Abstract. Understanding texture regularity in real images is a challenging computer vision task. We propose a higher-order feature matching algorithm to discover the lattices of ne...
IQIS
2005
ACM
14 years 1 months ago
2005
ACM
In this paper, we consider two important problems that commonly occur in bibliographic digital libraries, which seriously degrade their data qualities: Mixed Citation (MC) problem...