Sciweavers

868 search results - page 115 / 174
» A general compression algorithm that supports fast searching
Sort
View
MM
2009
ACM
198views Multimedia» more  MM 2009»
14 years 1 months ago
Scalable detection of partial near-duplicate videos by visual-temporal consistency
Following the exponential growth of social media, there now exist huge repositories of videos online. Among the huge volumes of videos, there exist large numbers of near-duplicate...
Hung-Khoon Tan, Chong-Wah Ngo, Richang Hong, Tat-S...
SDM
2008
SIAM
125views Data Mining» more  SDM 2008»
13 years 10 months ago
Mining and Ranking Generators of Sequential Patterns
Sequential pattern mining first proposed by Agrawal and Srikant has received intensive research due to its wide range applicability in many real-life domains. Various improvements...
David Lo, Siau-Cheng Khoo, Jinyan Li
CIKM
2009
Springer
14 years 1 months ago
Space-economical partial gram indices for exact substring matching
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
Nan Tang, Lefteris Sidirourgos, Peter A. Boncz
CIKM
2009
Springer
14 years 1 months ago
Density-based clustering using graphics processors
During the last few years, GPUs have evolved from simple devices for the display signal preparation into powerful coprocessors that do not only support typical computer graphics t...
Christian Böhm, Robert Noll, Claudia Plant, B...
COMPGEOM
2007
ACM
14 years 1 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann