Sciweavers

89 search results - page 6 / 18
» Fast paths in large-scale dynamic road networks
Sort
View
CEC
2008
IEEE
14 years 1 months ago
An approach to intrusion detection by means of idiotypic networks paradigm
Abstract— In this paper we present a novel intrusion detection architecture based on Idiotypic Network Theory (INIDIS), that aims at dealing with large scale network attacks feat...
Marek Ostaszewski, Pascal Bouvry, Franciszek Sered...
GIS
2002
ACM
13 years 6 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...
ESA
2008
Springer
112views Algorithms» more  ESA 2008»
13 years 9 months ago
Time-Dependent SHARC-Routing
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
Daniel Delling
INFOCOM
2010
IEEE
13 years 5 months ago
Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space
—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...
Wei Zeng, Rik Sarkar, Feng Luo 0002, Xianfeng Gu, ...
AINA
2008
IEEE
14 years 1 months ago
A Map Matching Algorithm for Car Navigation Systems that Predict User Destination
In this paper, we propose a map matching algorithm for car navigation systems that predict user destination. This car navigation system is a novel system that automatically predict...
Koichi Miyashita, Tsutomu Terada, Shojiro Nishio