Sciweavers

329 search results - page 27 / 66
» Fast structural similarity index algorithm
Sort
View
DATESO
2009
158views Database» more  DATESO 2009»
13 years 5 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...
BTW
2009
Springer
133views Database» more  BTW 2009»
13 years 11 months ago
High-Dimensional Indexing for Multimedia Features
Abstract: Efficient content-based similarity search in large multimedia databases requires efficient query processing algorithms for many practical applications. Especially in hi...
Ira Assent, Stephan Günnemann, Hardy Kremer, ...
IJCNN
2000
IEEE
13 years 12 months ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King
ICDE
2008
IEEE
112views Database» more  ICDE 2008»
14 years 9 months ago
XML Index Recommendation with Tight Optimizer Coupling
XML database systems are expected to handle increasingly complex queries over increasingly large and highly structured XML databases. An important problem that needs to be solved ...
Iman Elghandour, Ashraf Aboulnaga, Daniel C. Zilio...
EDBT
2006
ACM
159views Database» more  EDBT 2006»
14 years 7 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu