680 search results - page 7 / 136 » Computational Complexity and Anytime Algorithm for Inconsist... |
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
In this paper, we focus on the Image Registration problem. Mathematically, this problem consists of minimizing an energy which is composed of a regularization term and a similarit...
CSL
2001
Springer
14 years 8 days ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We describe an algorithm to compute the geodesics in an arbitrary CAT(0) cubical complex. A key tool is a correspondence between cubical complexes of global non-positive curvature ...
ICCSA
2007
Springer
14 years 1 months ago
2007
Springer
Ubiquitous multimedia services are emerging to be available at anytime and anywhere using a variety of computing devices. In this paper, we propose a low-complexity unequal loss pr...