Sciweavers

564 search results - page 90 / 113
» Linear Time Algorithms for Exact Distance Transform
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
14 years 9 months ago
Discovery of Convoys in Trajectory Databases
As mobile devices with positioning capabilities continue to proliferate, data management for so-called trajectory databases that capture the historical movements of populations of...
Hoyoung Jeung, Man Lung Yiu, Xiaofang Zhou, Christ...
IJRR
2008
115views more  IJRR 2008»
14 years 9 months ago
Planning High-quality Paths and Corridors Amidst Obstacles
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
Ron Wein, Jur P. van den Berg, Dan Halperin
SIAMSC
2008
168views more  SIAMSC 2008»
14 years 9 months ago
Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...
Siegfried M. Rump, Takeshi Ogita, Shin'ichi Oishi
99
Voted
STOC
2001
ACM
104views Algorithms» more  STOC 2001»
15 years 10 months ago
Spatial gossip and resource location protocols
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
David Kempe, Jon M. Kleinberg, Alan J. Demers
167
Voted
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
15 years 10 months ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...