459 search results - page 20 / 92 » Computational Complexity of Probabilistic Disambiguation |
124
click to vote
FCT
2005
Springer
15 years 5 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
GLOBECOM
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— For many evolving application scenarios like ubiquitous and autonomic computing systems, trustworthy computing solutions are essential. However the fact that the autono...
116
click to vote
DBSEC
2008
15 years 25 days ago
2008
To protect critical resources in today’s networked environments, it is desirable to quantify the likelihood of potential multi-step attacks that combine multiple vulnerabilities....
ACL
2010
14 years 9 months ago
2010
We present a novel approach to integrate transliteration into Hindi-to-Urdu statistical machine translation. We propose two probabilistic models, based on conditional and joint pr...
BMVC
2000
15 years 1 months ago
2000
Tracking interacting human body parts from a single two-dimensional view is difficult due to occlusion, ambiguity and spatio-temporal discontinuities. We present a Bayesian networ...