Sciweavers

2141 search results - page 112 / 429
» A distance model for rhythms
Sort
View
SPIRE
2005
Springer
15 years 11 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
IDA
2003
Springer
15 years 11 months ago
Fuzzy Clustering of Short Time-Series and Unevenly Distributed Sampling Points
This paper proposes a new clustering algorithm in the fuzzy-c-means family, which is designed to cluster time series and is particularly suited for short time series and those wit...
Carla S. Möller-Levet, Frank Klawonn, Kwang-H...
SIGIR
1999
ACM
15 years 10 months ago
Relevance Feedback Retrieval of Time Series Data
There has been much recent interest in retrieval of time series data. Earlier work has used a fixed similarity metric (e.g., Euclidean distance) to determine the similarity betwee...
Eamonn J. Keogh, Michael J. Pazzani
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
15 years 10 months ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel
FC
2010
Springer
135views Cryptology» more  FC 2010»
15 years 10 months ago
Multichannel Protocols to Prevent Relay Attacks
A number of security systems, from Chip-and-PIN payment cards to contactless subway and train tokens, as well as secure localization systems, are vulnerable to relay attacks. Encry...
Frank Stajano, Ford-Long Wong, Bruce Christianson