Sciweavers

4536 search results - page 396 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
EDBT
2000
ACM
15 years 10 months ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
ICML
2010
IEEE
15 years 8 months ago
Hilbert Space Embeddings of Hidden Markov Models
Hidden Markov Models (HMMs) are important tools for modeling sequence data. However, they are restricted to discrete latent states, and are largely restricted to Gaussian and disc...
Le Song, Sajid M. Siddiqi, Geoffrey J. Gordon, Ale...
CSDA
2006
83views more  CSDA 2006»
15 years 6 months ago
Linear grouping using orthogonal regression
A new method to detect different linear structures in a data set, called Linear Grouping Algorithm (LGA), is proposed. LGA is useful for investigating potential linear patterns in...
Stefan Van Aelst, Xiaogang Wang, Ruben H. Zamar, R...
SDM
2010
SIAM
202views Data Mining» more  SDM 2010»
15 years 5 months ago
Multiresolution Motif Discovery in Time Series
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
Nuno Castro, Paulo J. Azevedo

Lecture Notes
700views
17 years 4 months ago
Foundations of Computer Science
"This course has two objectives. First (and obvious) is to teach programming. Second is to present some fundamental principles of computer science, especially algorithm desi...
Lawrence C Paulson