Sciweavers

459 search results - page 57 / 92
» Computational Complexity of Probabilistic Disambiguation
Sort
View
PODC
2004
ACM
15 years 5 months ago
Signed quorum systems
Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...
Haifeng Yu
ECCV
2002
Springer
16 years 1 months ago
Automatic Detection and Tracking of Human Motion with a View-Based Representation
Abstract. This paper proposes a solution for the automatic detection and tracking of human motion in image sequences. Due to the complexity of the human body and its motion, automa...
Ronan Fablet, Michael J. Black
CORR
2010
Springer
105views Education» more  CORR 2010»
14 years 6 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
COMPUTER
2002
129views more  COMPUTER 2002»
14 years 11 months ago
Networks on Chips: A New SoC Paradigm
of abstraction and coarse granularity and distributed communication control. Focusing on using probabilistic metrics such as average values or variance to quantify design objective...
Luca Benini, Giovanni De Micheli
FLOPS
2004
Springer
15 years 5 months ago
A Brief Survey of Quantum Programming Languages
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
Peter Selinger