In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
We present an analytical method to estimate the absolute registration error bounds if two surfaces were to be aligned using the ICP (Iterative Closest Point) algorithm. The estima...
coarse procedures or very abstract frames from the point of view of algorithm, because some crucial issues like the representation, evolution, storage, and learning process of conc...
The Conditional Random Fields (CRF) model, using
patch-based classification bound with context information,
has recently been widely adopted for image segmentation/
labeling. In...
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...