914 search results - page 129 / 183 » The Computational Complexity of Probabilistic Planning |
SFM
2007
Springer
14 years 3 months ago
2007
Springer
Stochastic performance models provide a powerful way of capturing and analysing the behaviour of complex concurrent systems. Traditionally, performance measures for these models ar...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
Due to computational intractability, large scale coordination algorithms are necessarily heuristic and hence require tuning for particular environments. In domains where character...
CVIU
2007
13 years 8 months ago
2007
Multi-view face detection plays an important role in many applications. This paper presents a statistical learning method to extract features and construct classifiers for multi-...
FOCS
1995
IEEE
14 years 15 days ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
ECCV
2004
Springer
14 years 10 months ago
2004
Springer
Data association (obtaining correspondences) is a ubiquitous problem in computer vision. It appears when matching image features across multiple images, matching image features to ...