Sciweavers

49 search results - page 2 / 10
» Compaction Techniques for Nextword Indexes
Sort
View
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
13 years 2 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...
CORR
2010
Springer
194views Education» more  CORR 2010»
13 years 7 months ago
An Effective Method of Image Retrieval using Image Mining Techniques
The present research scholars are having keen interest in doing their research activities in the area of Data mining all over the world. Especially, [13]Mining Image data is the o...
A. Kannan, V. Mohan, N. Anbazhagan
PR
2002
88views more  PR 2002»
13 years 10 months ago
Indexing chromatic and achromatic patterns for content-based colour image retrieval
In this paper, we present a method to represent achromatic and chromatic image signals independently for content-based image indexing and retrieval for image database applications...
Guoping Qiu
ICDE
2004
IEEE
105views Database» more  ICDE 2004»
15 years 15 days ago
SPINE: Putting Backbone into String Indexing
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
Naresh Neelapala, Romil Mittal, Jayant R. Haritsa
TKDE
2011
332views more  TKDE 2011»
13 years 6 months ago
Adaptive Cluster Distance Bounding for High-Dimensional Indexing
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
Sharadh Ramaswamy, Kenneth Rose