1686 search results - page 99 / 338 » Programs as polygraphs: computability and complexity |
CVIU
2008
14 years 10 months ago
2008
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Deployment of distributed applications on large systems, and especially on grid infrastructures, becomes a more and more complex task. Grid users spend a lot of time to prepare, in...
BIRTHDAY
2010
Springer
14 years 11 months ago
2010
Springer
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
HPCC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Recent advances in processor technology such as Simultaneous Multithreading (SMT) and Chip Multiprocessing (CMP) enable parallel processing on a single die. These process...
CSR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We study structural properties of restricted width arithmetical circuits. It is shown that syntactically multilinear arithmetical circuits of constant width can be effici...