Sciweavers

17541 search results - page 8 / 3509
» Complexity in scalable computing
Sort
View
PODC
2009
ACM
15 years 4 months ago
Fast scalable deterministic consensus for crash failures
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...
CVPR
2007
IEEE
15 years 11 months ago
Leveraging temporal, contextual and ordering constraints for recognizing complex activities in video
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...
Benjamin Laxton, Jongwoo Lim, David J. Kriegman
ICASSP
2009
IEEE
15 years 4 months ago
A low complexity Orthogonal Matching Pursuit for sparse signal approximation with shift-invariant dictionaries
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...
Boris Mailhé, Rémi Gribonval, Fr&eac...
SEMWEB
2009
Springer
15 years 4 months ago
Parallelization and Distribution Techniques for Ontology Matching in Urban Computing Environments
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...
DCC
2006
IEEE
15 years 3 months ago
A Fast and Low Complexity Image Codec based on Backward Coding of Wavelet Trees
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 ...