Sciweavers

911 search results - page 79 / 183
» On the Distance of Databases
Sort
View
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
14 years 1 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
SSD
2007
Springer
133views Database» more  SSD 2007»
14 years 1 months ago
Compression of Digital Road Networks
Abstract. In the consumer market, there has been an increasing interest in portable navigation systems in the last few years. These systems usually work on digital map databases st...
Jonghyun Suh, Sungwon Jung, Martin Pfeifle, Khoa T...
ISMIR
2000
Springer
176views Music» more  ISMIR 2000»
13 years 11 months ago
SEMEX - An efficient Music Retrieval Prototype
We present an efficient prototype for music information retrieval. The prototype uses bitparallel algorithms for locating transposition invariant matches of monophonic query melod...
Kjell Lemström, S. Perttu
ICPR
2006
IEEE
14 years 8 months ago
A fast binary-image comparison method with local-dissimilarity quantification
Image similarity measure is widely used in image processing. For binary images that are not composed of a single shape, a local comparison is interesting but the features are usel...
Etienne Baudrier, Frédéric Nicolier,...
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 1 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...