Sciweavers

16 search results - page 1 / 4
» An Efficient Path Computation Model for Hierarchically Struc...
Sort
View
TKDE
2002
239views more  TKDE 2002»
13 years 4 months ago
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
Sungwon Jung, Sakti Pramanik
APWEB
2006
Springer
13 years 8 months ago
Efficient Dynamic Traffic Navigation with Hierarchical Aggregation Tree
Nowadays, the rapid advances in wireless communications, positioning techniques and mobile devices enable location based service such as dynamic traffic navigation. Yet, it is a ch...
Yun Bai, Yanyan Guo, Xiaofeng Meng, Tao Wan, Karin...
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
13 years 9 months ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
JCNS
2010
103views more  JCNS 2010»
12 years 11 months ago
Efficient computation of the maximum a posteriori path and parameter estimation in integrate-and-fire and more general state-spa
A number of important data analysis problems in neuroscience can be solved using state-space models. In this article, we describe fast methods for computing the exact maximum a pos...
Shinsuke Koyama, Liam Paninski
GEOINFORMATICA
1998
125views more  GEOINFORMATICA 1998»
13 years 4 months ago
Computational Perspectives on Map Generalization
ally related entity types, or classes, into higher level, more abstract types, as part of a hierarchical classi®cation scheme. graphy, generalization retains the notion of abstrac...
Robert Weibel, Christopher B. Jones