Sciweavers

2514 search results - page 47 / 503
» On the Computation of Approximations of Database Queries
Sort
View
ICDE
2007
IEEE
126views Database» more  ICDE 2007»
16 years 7 months ago
QPIAD: Query Processing over Incomplete Autonomous Databases
Incompleteness due to missing attribute values (aka "null values") is very common in autonomous web databases, on which user accesses are usually supported through media...
Hemal Khatri, Jianchun Fan, Yi Chen, Subbarao Kamb...
SAC
2005
ACM
15 years 12 months ago
A complex biological database querying method
Many biological information systems rely on relational database management systems (RDBMS) to manage high-throughput biological data. While keeping these data well archived, organ...
Jake Yue Chen, John V. Carlis, Ning Gao
DOLAP
2005
ACM
15 years 8 months ago
Providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
Alfredo Cuzzocrea
PODS
2002
ACM
132views Database» more  PODS 2002»
16 years 6 months ago
Distributed Computation of Web Queries Using Automata
We introduce and investigate a distributed computation model for querying the Web. Web queries are computed by interacting automata running at different nodes in the Web. The auto...
Marc Spielmann, Jerzy Tyszkiewicz, Jan Van den Bus...
ECCV
2010
Springer
15 years 11 months ago
Fast Approximate Nearest Neighbor Methods for Non-Euclidean Manifolds with Applications to Human Activity Analysis in Videos
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
Rizwan Chaudhry, Yuri Ivanov