Sciweavers

673 search results - page 22 / 135
» Querying Continuous Time Sequences
Sort
View
DEXA
2003
Springer
162views Database» more  DEXA 2003»
15 years 3 months ago
Dynamic Splitting Policies of the Adaptive 3DR-Tree for Indexing Continuously Moving Objects
Moving-objects databases need a spatio-temporal indexing scheme for moving objects to efficiently process queries over continuously changing locations of the objects. A simple exte...
Bonggi Jun, Bonghee Hong, Byunggu Yu
ICIP
2005
IEEE
15 years 11 months ago
Spacetime-continuous geometry meshes from multi-view video sequences
We reconstruct geometry for a time-varying scene given by a number of video sequences. The dynamic geometry is represented by a 3D hypersurface embedded in space-time. The interse...
Bastian Goldlücke, Marcus A. Magnor
75
Voted
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
15 years 3 months ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao
DBSEC
2004
108views Database» more  DBSEC 2004»
14 years 11 months ago
Why Is this User Asking so Many Questions? Explaining Sequences of Queries
A sequence of queries submitted by a database user within a short period of time may have a single, illuminating explanation. In this paper we consider sequences of single-record q...
Aybar C. Acar, Amihai Motro
VLDB
2008
ACM
103views Database» more  VLDB 2008»
15 years 10 months ago
The optimal sequenced route query
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
Mehdi Sharifzadeh, Mohammad R. Kolahdouzan, Cyrus ...