Sciweavers

2736 search results - page 194 / 548
» Indexing uncertain data
Sort
View
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
14 years 9 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...
VLDB
2001
ACM
66views Database» more  VLDB 2001»
15 years 11 months ago
An Evaluation of Generic Bulk Loading Techniques
Bulk loading refers to the process of creating an index from scratch for a given data set. This problem is well understood for B-trees, but so far, non-traditional index structure...
Jochen Van den Bercken, Bernhard Seeger
XIMEP
2005
ACM
121views Database» more  XIMEP 2005»
16 years 1 days ago
Adaptive XML Storage or The Importance of Being Lazy
Building an XML store means finding solutions to the problems of representing, accessing, querying and updating XML data. The irregularity of both the structure and usage of XML, ...
Cristian Duda, Donald Kossmann
ADC
2007
Springer
183views Database» more  ADC 2007»
15 years 10 months ago
Efficient Similarity Search by Summarization in Large Video Database
With the explosion of video data, video processing technologies have advanced quickly and been applied into many fields, such as advertisements, medical etc.. To fast search these...
Xiangmin Zhou, Xiaofang Zhou, Heng Tao Shen
IJCM
2007
205views more  IJCM 2007»
15 years 6 months ago
BTF modelling using BRDF texels
The highest fidelity representations of realistic real-world materials currently used comprise Bidirectional Texture Functions (BTF). The BTF is a six dimensional function dependi...
Jirí Filip, Michal Haindl