Sciweavers

3146 search results - page 8 / 630
» Efficient Consequence Finding
Sort
View
IPL
2008
95views more  IPL 2008»
13 years 7 months ago
Efficient algorithms for finding interleaving relationship between sequences
The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, m...
Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Hs...
ICPR
2002
IEEE
14 years 8 months ago
Prototype Selection for Finding Efficient Representations of Dissimilarity Data
The nearest neighbor (NN) rule is a simple and intuitive method for solving classification problems. Originally, it uses distances to the complete training set. It performs well, ...
Elzbieta Pekalska, Robert P. W. Duin
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 7 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
RECOMB
2009
Springer
14 years 2 months ago
Finding Nested Common Intervals Efficiently
Guillaume Blin, Jens Stoye