Sciweavers

2376 search results - page 43 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
ICDE
2001
IEEE
180views Database» more  ICDE 2001»
14 years 9 months ago
Distinctiveness-Sensitive Nearest Neighbor Search for Efficient Similarity Retrieval of Multimedia Information
Nearest neighbor (NN) search in high dimensional feature space is widely used for similarity retrieval of multimedia information. However, recent research results in the database ...
Norio Katayama, Shin'ichi Satoh
ICML
2000
IEEE
14 years 8 months ago
A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
Paul Komarek, Andrew W. Moore
HICSS
2006
IEEE
149views Biometrics» more  HICSS 2006»
14 years 1 months ago
An Efficient Heuristic Search for Real-Time Frequent Pattern Mining
Real-time frequent pattern mining for business intelligence systems are currently in the focal area of research. In a number of areas of doing business, especially in the arena of...
Rajanish Dass, Ambuj Mahanti
ICDM
2005
IEEE
271views Data Mining» more  ICDM 2005»
14 years 1 months ago
HOT SAX: Efficiently Finding the Most Unusual Time Series Subsequence
In this work, we introduce the new problem of finding time series discords. Time series discords are subsequences of a longer time series that are maximally different to all the r...
Eamonn J. Keogh, Jessica Lin, Ada Wai-Chee Fu
IFIP
2004
Springer
14 years 1 months ago
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
Paola Flocchini, Antonio Mesa Enriques, Linda Pagl...