2168 search results - page 251 / 434 » Randomized Algorithms and Complexity Theory |
129
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
148
Voted
IANDC
2008
15 years 3 months ago
2008
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
107
Voted
ICMLA
2008
15 years 5 months ago
2008
When using machine learning for in silico modeling, the goal is normally to obtain highly accurate predictive models. Often, however, models should also bring insights into intere...
117
Voted
UAI
2003
15 years 5 months ago
2003
The paper studies empirically the time-space trade-off between sampling and inference in the cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian ...
189
click to vote
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...