Sciweavers

1421 search results - page 203 / 285
» Algorithms for subsequence combinatorics
Sort
View
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
16 years 1 months ago
Exact Discovery of Time Series Motifs.
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...
Abdullah Mueen, Eamonn J. Keogh, M. Brandon Westov...
IJCNN
2008
IEEE
15 years 10 months ago
Filter Bank Common Spatial Pattern (FBCSP) in Brain-Computer Interface
—In motor imagery-based Brain Computer Interfaces (BCI), discriminative patterns can be extracted from the electroencephalogram (EEG) using the Common Spatial Pattern (CSP) algor...
Kai Keng Ang, Zhang Yang Chin, Haihong Zhang, Cunt...
CP
2004
Springer
15 years 9 months ago
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
Vincent A. Cicirello, Stephen F. Smith
135
Voted
AAAI
2010
15 years 5 months ago
Efficient Lifting for Online Probabilistic Inference
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
Aniruddh Nath, Pedro Domingos
SODA
2003
ACM
167views Algorithms» more  SODA 2003»
15 years 5 months ago
Counting inversions in lists
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...
Anupam Gupta, Francis Zane