Back to Results
First PageMeta Content
Data management / Minimum bounding rectangle / R* tree / Nearest neighbor search / Separator / X-tree / Database / M-tree / Array data structure / Information science / R-tree / Information


High-dimensional indexing for multimedia features Ira Assent∗ Stephan G¨unnemann+ Hardy Kremer+ Thomas Seidl+ ∗ Department of Computer Science Aalborg University, Denmark [removed]
Add to Reading List

Document Date: 2013-10-04 11:04:10


Open Document

File Size: 547,94 KB

Share Result on Facebook

/

Facility

Data Exploration Group RWTH Aachen University / Computer Science Aalborg University / /

IndustryTerm

index-based search algorithms / content-based similarity search / query processing algorithm / query processing / lter-and-refine processing / correct query processing algorithm / efficient query processing / overall search time / construction algorithm / similarity search process / lter-and-refine algorithms / overall algorithm / efficient query processing algorithms / lter-and-refine algorithm / efficient algorithms / /

Organization

Data Mining and Data Exploration Group RWTH Aachen University / Aalborg University / /

Person

Ira Assent∗ Stephan / Thomas Seidl / /

Position

Prime Minister / /

Technology

lter-and-refine algorithms / overall algorithm / B-Tree construction algorithm / efficient algorithms / correct query processing algorithm / tomography / query processing algorithm / Data Mining / lter-and-refine algorithm / efficient query processing algorithms / random access / eventually index-based search algorithms / Multistep algorithms / digital photography / /

SocialTag