Sciweavers

905 search results - page 68 / 181
» On the Complexity of uSPR Distance
Sort
View
SSD
1995
Springer
97views Database» more  SSD 1995»
15 years 1 months ago
Ranking in Spatial Databases
Abstract. An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatia...
Gísli R. Hjaltason, Hanan Samet
DEXA
2008
Springer
120views Database» more  DEXA 2008»
14 years 11 months ago
Compressing Very Large Database Workloads for Continuous Online Index Selection
The paper presents a novel method for compressing large database workloads for purpose of autonomic, continuous index selection. The compressed workload contains a small subset of ...
Piotr Kolaczkowski
SIGDIAL
2010
14 years 7 months ago
Comparing Spoken Language Route Instructions for Robots across Environment Representations
Spoken language interaction between humans and robots in natural environments will necessarily involve communication about space and distance. The current study examines people�...
Matthew Marge, Alexander I. Rudnicky
ICRA
2010
IEEE
142views Robotics» more  ICRA 2010»
14 years 8 months ago
A quadratic regulator-based heuristic for rapidly exploring state space
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
Elena Leah Glassman, Russ Tedrake
JCB
2000
87views more  JCB 2000»
14 years 9 months ago
Comparison of Additive Trees Using Circular Orders
It has been postulated that existing species have been linked in the past in a way that can be described using an additive tree structure. Any such tree structure reflecting speci...
Vladimir Makarenkov, Bruno Leclerc