693 search results - page 77 / 139 » Probabilistic Interactive Installations |
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
— We present an outdoor terrain planner that finds near optimal trajectories under dynamic and kinematic constraints. The planner can find solutions in close to real time by re...
ACL
2006
13 years 10 months ago
2006
Current parsing models are not immediately applicable for languages that exhibit strong interaction between morphology and syntax, e.g., Modern Hebrew (MH), Arabic and other Semit...
ANLP
1997
13 years 10 months ago
1997
Statistical models of word-sense disambiguation are often based on a small number of contextual features or on a model that is assumed to characterize the interactions among a set...
COCO
2005
Springer
14 years 2 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
CC
2007
Springer
13 years 9 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...