We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
The optimization of similarity queries using metric access methods has been widely discussed in the last decades. Similarity queries consider one object as the query center, and re...
Humberto Luiz Razente, Maria Camila Nardini Barion...
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
Abstract—In Network-on-Chip (NoC) application design, coreto-node mapping is an important but intractable optimization problem. In the paper, we use simulated annealing to tackle...
In this paper, we present a “value mapping” algorithm that does not rely on syntactic similarity or semantic interpretation of the values. The algorithm first constructs a st...
Jaewoo Kang, Tae Sik Han, Dongwon Lee, Prasenjit M...