320 search results - page 45 / 64 » Exponential shadow maps |
KR
1994
Springer
15 years 1 months ago
1994
Springer
Probabilistic AI planning methods that minimize expected execution cost have a neutral attitude towards risk. We demonstrate how one can transform planning problems for risk-sensi...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract--Recently Kutin and Niyogi investigated several notions of algorithmic stability--a property of a learning map conceptually similar to continuity--showing that training-st...
81
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We generalize the notion of non-crossing partition on a disk to general surfaces with boundary. For this, we consider a surface Σ and introduce the number CΣ(n) of noncrossing pa...
JMLR
2010
14 years 4 months ago
2010
There is a growing interest in building probabilistic models with high order potentials (HOPs), or interactions, among discrete variables. Message passing inference in such models...
JMLR
2010
14 years 4 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...