Sciweavers

2514 search results - page 182 / 503
» On the Computation of Approximations of Database Queries
Sort
View
MICAI
2004
Springer
15 years 12 months ago
Faster Proximity Searching in Metric Data
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
Edgar Chávez, Karina Figueroa
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
16 years 8 months ago
On Multidimensional k-Anonymity with Local Recoding Generalization
This paper presents the first theoretical study, on using local-recoding generalization (LRG) to compute a kanonymous table with quality guarantee. First, we prove that it is NP-h...
Yang Du, Tian Xia, Yufei Tao, Donghui Zhang, Feng ...
ICPR
2002
IEEE
16 years 7 months ago
Content Based Image Retrieval Using Optimum Peano Scan
We present a new technique for content based image retrieval where feature vector to be matched is very much specific to the query image. A particular Peano scan which is optimal ...
N. Jhanwar, Subhasis Chaudhuri, Guna Seetharaman, ...
WEBDB
2000
Springer
136views Database» more  WEBDB 2000»
15 years 10 months ago
An Optimization Technique for Answering Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in data integration, data warehousing and query optimization. Query rewriting in relational databases i...
Gösta Grahne, Alex Thomo
EDBT
2010
ACM
185views Database» more  EDBT 2010»
15 years 8 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen