Sciweavers

360 search results - page 29 / 72
» Indexing the Distance: An Efficient Method to KNN Processing
Sort
View
ICIP
2001
IEEE
16 years 2 months ago
Color image coding, indexing and retrieval using binary space partitioning tree
This paper presents a unified approach to colour image coding, content-based indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, tradition...
Guoping Qiu, S. Sudirman
97
Voted
SIGMOD
2002
ACM
114views Database» more  SIGMOD 2002»
16 years 19 days ago
Time-parameterized queries in spatio-temporal databases
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
Yufei Tao, Dimitris Papadias
180
Voted
SIGMOD
2006
ACM
129views Database» more  SIGMOD 2006»
16 years 19 days ago
InMAF: indexing music databases via multiple acoustic features
Music information processing has become very important due to the ever-growing amount of music data from emerging applications. In this demonstration, we present a novel approach ...
Jialie Shen, John Shepherd, Anne H. H. Ngu
160
Voted
DBA
2006
236views Database» more  DBA 2006»
15 years 1 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...
245
Voted
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
16 years 2 months ago
Efficient Processing of Warping Time Series Join of Motion Capture Data
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis wh...
Yueguo Chen, Gang Chen, Ke Chen, Beng Chin Ooi