We present a collision attack on the hash function HAS-160 reduced to 53-steps. The attack has a complexity of about 235 hash computations. The attack is based on the work of Cho e...
This paper reports our experience with representing and reasoning with context information within the CARE middleware. CARE was developed to support context-aware service adaptati...
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
Abstract— In this paper we show how to optimize the computational cost and maximize consistency in EKF-based SLAM for large environments. We combine Local Mapping with Map Joinin...
Abstract. The aim of this article is to explore and investigate possibilities of reuse already known techniques from object and objectoriented processing for effective processing i...