Sciweavers

3652 search results - page 140 / 731
» A study of query length
Sort
View
CASC
2009
Springer
180views Mathematics» more  CASC 2009»
13 years 9 months ago
Effective Quantifier Elimination for Presburger Arithmetic with Infinity
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
Aless Lasaruk, Thomas Sturm
SIGMOD
2001
ACM
124views Database» more  SIGMOD 2001»
14 years 8 months ago
Space-Efficient Online Computation of Quantile Summaries
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
Michael Greenwald, Sanjeev Khanna
ICMCS
2006
IEEE
120views Multimedia» more  ICMCS 2006»
14 years 2 months ago
An Efficient Numeric Indexing Technique for Music Retrieval System
Space requirement for storing indexes and performance for query processing are two critical issues in music information retrieval (MIR) system. To overcome difficulties in variabl...
Chuan-Wang Chang, Hewijin Christine Jiau
TKDE
2002
127views more  TKDE 2002»
13 years 7 months ago
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
Shashi Shekhar, Chang-Tien Lu, Sanjay Chawla, Siva...
MDM
2004
Springer
110views Communications» more  MDM 2004»
14 years 1 months ago
Universal Trajectory Queries for Moving Object Databases
In this paper, we consider a data model for uncertain trajectories of moving objects. In our model, the trajectory is a vector of uniform stochastic processes. We study “univers...
Hoda Mokhtar, Jianwen Su