822 search results - page 84 / 165 » Hashing Methods for Temporal Data |
121
click to vote
ICAPR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This paper addresses the clustering problem of hidden dynamical systems behind observed multivariate sequences by assuming an interval-based temporal structure in the seq...
128
Voted
ISCAS
2005
IEEE
15 years 8 months ago
2005
IEEE
— We present a frequency-domain method of noisy convolutive source separation, where we extends the SEONS algorithm [2] that jointly exploits the nonstationarity and temporal str...
131
Voted
JIIS
2006
15 years 2 months ago
2006
: Geographic information (e.g., locations, networks, and nearest neighbors) are unique and different from other aspatial attributes (e.g., population, sales, or income). It is a ch...
121
click to vote
ICCV
2003
IEEE
16 years 4 months ago
2003
IEEE
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are co...
130
click to vote
KDD
1997
ACM
15 years 6 months ago
1997
ACM
In this paper 1 we present a method for discovering approximately common motifs (also known as active motifs) in three dimensional (3D) molecules. Each node in a molecule is repre...