Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated...
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...