42230 search results - page 77 / 8446 » Algorithms and Complexity Results for |
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
AAAI
2010
14 years 11 months ago
2010
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
DAGSTUHL
2004
14 years 11 months ago
2004
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
WEA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...