Sciweavers

2252 search results - page 363 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
GIS
2007
ACM
14 years 10 months ago
TS2-tree - an efficient similarity based organization for trajectory data
The increasingly popular GPS technology and the growing amount of trajectory data it generates create the need for developing applications that efficiently store and query traject...
Petko Bakalov, Eamonn J. Keogh, Vassilis J. Tsotra...
ICML
2008
IEEE
14 years 9 months ago
On the quantitative analysis of deep belief networks
Deep Belief Networks (DBN's) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allow...
Ruslan Salakhutdinov, Iain Murray
WWW
2006
ACM
14 years 9 months ago
Semantic link based top-K join queries in P2P networks
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
Jie Liu, Liang Feng, Chao He
KDD
2004
ACM
182views Data Mining» more  KDD 2004»
14 years 9 months ago
Rotation invariant distance measures for trajectories
For the discovery of similar patterns in 1D time-series, it is very typical to perform a normalization of the data (for example a transformation so that the data follow a zero mea...
Michail Vlachos, Dimitrios Gunopulos, Gautam Das
KDD
2002
ACM
125views Data Mining» more  KDD 2002»
14 years 9 months ago
Pattern discovery in sequences under a Markov assumption
In this paper we investigate the general problem of discovering recurrent patterns that are embedded in categorical sequences. An important real-world problem of this nature is mo...
Darya Chudova, Padhraic Smyth