364 search results - page 20 / 73 » Dimension Characterizations of Complexity Classes |
IWCIA
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
ATAL
2011
Springer
12 years 7 months ago
2011
Springer
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
ISCA
1998
IEEE
13 years 11 months ago
1998
IEEE
Commercial applications such as databases and Web servers constitute the largest and fastest-growing segment of the market for multiprocessor servers. Ongoing innovations in disk ...
BIRD
2008
Springer
13 years 9 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
WOLLIC
2010
Springer
14 years 12 days ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...