Sciweavers

1888 search results - page 37 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
WAIM
2007
Springer
15 years 4 months ago
An Efficient Spatial Search Method Based on SG-Tree
To solve the overlapping search of multidimensional spatial database containing large quantity of objects with dynamic spatial extent, this paper proposes an index structure named ...
Yintian Liu, Changjie Tang, Lei Duan, Tao Zeng, Ch...
ICIP
2003
IEEE
15 years 3 months ago
Parameter estimation for spatial random trees using the EM algorithm
A new class of multiscale multidimensional stochastic processes called spatial random trees was recently introduced in [9]. The model is based on multiscale stochastic trees with ...
Ilya Pollak, Jeffrey Mark Siskind, Mary P. Harper,...
ESA
2010
Springer
179views Algorithms» more  ESA 2010»
14 years 10 months ago
On Space Efficient Two Dimensional Range Minimum Data Structures
The two dimensional range minimum query problem is to preprocess a static two dimensional m by n array A of size N = m
Gerth Stølting Brodal, Pooya Davoodi, S. Sr...
ICPR
2004
IEEE
15 years 11 months ago
Joint Spatial and Temporal Structure Learning for Task based Control
We present an example of a joint spatial and temporal task learning algorithm that results in a generative model that has applications for on-line visual control. We review work o...
Hilary Buxton, Kingsley Sage
74
Voted
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
15 years 10 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount