Sciweavers

707 search results - page 47 / 142
» Solving path problems on the GPU
Sort
View
ESA
2011
Springer
231views Algorithms» more  ESA 2011»
13 years 11 months ago
Distribution-Aware Compressed Full-Text Indexes
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
Paolo Ferragina, Jouni Sirén, Rossano Ventu...
ICPR
2004
IEEE
16 years 28 days ago
Multi Feature Path Modeling for Video Surveillance
This paper proposes a novel method for detecting nonconforming trajectories of objects as they pass through a scene. Existing methods mostly use spatial features to solve this pro...
Imran N. Junejo, Mubarak Shah, Omar Javed
IPPS
2007
IEEE
15 years 6 months ago
Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
Joseph R. Crobak, Jonathan W. Berry, Kamesh Maddur...
AR
2007
103views more  AR 2007»
14 years 11 months ago
Stability of autonomous vehicle path tracking with pure delays in the control loop
This paper presents a new method to analyze the stability of a general class of mobile robot path tracking algorithms taking into account explicitly the computation and communicat...
Guillermo Heredia, Aníbal Ollero
ISAAC
2010
Springer
308views Algorithms» more  ISAAC 2010»
14 years 9 months ago
Levelwise Mesh Sparsification for Shortest Path Queries
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo