Sciweavers

607 search results - page 80 / 122
» Visual Representation of Database Queries using Structural S...
Sort
View
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 6 days ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
UBIMOB
2009
ACM
154views Management» more  UBIMOB 2009»
15 years 4 months ago
SoCQ: a pervasive environment management system
Pervasive systems give an overview of what digital environments should look like in the future. SoCQ takes a data-oriented perspective on the pervasive environment through a uni...
Yann Gripay, Frédérique Laforest, Je...
EDBT
2000
ACM
15 years 2 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
TCBB
2008
95views more  TCBB 2008»
14 years 9 months ago
Solving the Problem of Trans-Genomic Query with Alignment Tables
Abstract-- The trans-genomic query (TGQ) problem -- enabling the free query of biological information, even across genomes -- is a central challenge facing bioinformatics. Solution...
Douglas Stott Parker Jr., Ruey-Lung Hsiao, Yi Xing...
CVPR
2010
IEEE
14 years 11 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...