Sciweavers

360 search results - page 17 / 72
» Dynamic Sample Selection for Approximate Query Processing
Sort
View
CHI
1994
ACM
15 years 3 months ago
Using aggregation and dynamic queries for exploring large data sets
When working with large data sets, users perform three primary types of activities: data manipulation, data analysis, and data visualization. The data manipulation process involve...
Jade Goldstein, Steven F. Roth
ECCV
2004
Springer
16 years 1 months ago
Optimal Importance Sampling for Tracking in Image Sequences: Application to Point Tracking
Abstract. In this paper, we propose a particle filtering approach for tracking applications in image sequences. The system we propose combines a measurement equation and a dynamic ...
Étienne Mémin, Elise Arnaud
SCCC
2003
IEEE
15 years 5 months ago
Improved Deletions in Dynamic Spatial Approximation Trees
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
Gonzalo Navarro, Nora Reyes
ACIVS
2008
Springer
15 years 6 months ago
Sub-optimal Camera Selection in Practical Vision Networks through Shape Approximation
Within a camera network, the contribution of a camera to the observations of a scene depends on its viewpoint and on the scene configuration. This is a dynamic property, as the sc...
Huang Lee, Linda Tessens, Marleen Morbée, H...
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
16 years 1 months ago
On MBR Approximation of Histories for Historical Queries: Expectations and Limitations
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
Reza Sherkat, Davood Rafiei