We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
We present a scalable approach to recognizing and describing complex activities in video sequences. We are interested in long-term, sequential activities that may have several par...
We propose a variant of Orthogonal Matching Pursuit (OMP), called LoCOMP, for scalable sparse signal approximation. The algorithm is designed for shift-invariant signal dictionari...
The usage of parallelization and distribution techniques in the field of ontology matching is of high interest for the semantic web community. This work presents an approach for ma...
Axel Tenschert, Matthias Assel, Alexey Cheptsov, G...
A new approach of backward coding of wavelet trees (BCWT) is presented. Contrary to the common “forward” coding of wavelet trees from the highest level (lowest resolution), th...
Jiangling Guo, Sunanda Mitra, Brian Nutter, Tanja ...