13603 search results - page 69 / 2721 » On the Complexity of Computing Treelength |
ICIP
1998
IEEE
14 years 10 months ago
1998
IEEE
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
AAAI
2010
13 years 10 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...
LICS
2008
IEEE
14 years 3 months ago
2008
IEEE
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
CIE
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We prove that the one-dimensional sandpile prediction problem is in AC1 . The previously best known upper bound on the ACi -scale was AC2 . We also prove that it is not i...
ECAL
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. In this paper we explore the similarities between a mathematical model of language evolution and several A-life simulations. We argue that the mathematical model makes so...