138 search results - page 11 / 28 » Efficient Expected-Case Algorithms for Planar Point Location |
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Location cloaking has been proposed and well studied to protect user privacy. It blurs the accurate user location (i.e., a point with coordinates) and replaces it with a well-shape...
FAW
2008
Springer
13 years 9 months ago
2008
Springer
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
NN
2000
Springer
13 years 7 months ago
2000
Springer
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
COMGEO
2006
ACM
13 years 8 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
GEOINFORMATICA
2008
13 years 8 months ago
2008
Abstract. Widespread availability of location aware devices (such as GPS receivers) promotes capture of detailed movement trajectories of people, animals, vehicles and other moving...