Sciweavers

1991 search results - page 142 / 399
» Small Models of Large Machines
Sort
View
ICML
2006
IEEE
16 years 6 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
15 years 10 months ago
On the Power of Quantum Proofs
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
Ran Raz, Amir Shpilka
CVIU
2004
125views more  CVIU 2004»
15 years 5 months ago
Efficient detection under varying illumination conditions and image plane rotations
This paper focuses on the detection of objects with a Lambertian surface under varying illumination and pose. We offer to apply a novel detection method that proceeds by modeling ...
Margarita Osadchy, Daniel Keren
INFOCOM
2003
IEEE
15 years 10 months ago
Network Management Information For Light-Path Assessment: Trade-off between Performance and Complexity
We investigate network management information for light-path assessment to dynamically set up end-to-end lightpaths across administrative domains. Our focus is on invetigating what...
Guanglei Liu, Chuanyi Ji, Vincent W. S. Chan
DAC
2010
ACM
15 years 9 months ago
Representative path selection for post-silicon timing prediction under variability
The identification of speedpaths is required for post-silicon (PS) timing validation, and it is currently becoming timeconsuming due to manufacturing variations. In this paper we...
Lin Xie, Azadeh Davoodi