Sciweavers

1082 search results - page 79 / 217
» Approximation Algorithms for Spreading Points
Sort
View
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
13 years 7 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid
GIS
2004
ACM
14 years 8 months ago
Efficient detection of motion patterns in spatio-temporal data sets
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of detecting four such spatio-temporal patterns, namely flock,...
Joachim Gudmundsson, Marc J. van Kreveld, Bettina ...
SSD
2005
Springer
108views Database» more  SSD 2005»
14 years 1 months ago
On Trip Planning Queries in Spatial Databases
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
Feifei Li, Dihan Cheng, Marios Hadjieleftheriou, G...
ICCS
2001
Springer
14 years 5 days ago
Parallel High-Dimensional Integration: Quasi-Monte Carlo versus Adaptive Cubature Rules
Abstract Parallel algorithms for the approximation of a multi-dimensional integral over an hyper-rectangular region are discussed. Algorithms based on quasi-Monte Carlo techniques ...
Rudolf Schürer
WSCG
2004
106views more  WSCG 2004»
13 years 9 months ago
Recognition of Occluded Objects Using Curvature
New approaches of object representation reliable for partially occluded objects recognition are introduced in this article. Objects are represented by their boundaries, which are ...
Filip Krolupper