221 search results - page 41 / 45 » Analyzing the Implicit Computational Complexity of object-or... |
RECOMB
2006
Springer
14 years 8 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
IWVF
2001
Springer
14 years 25 days ago
2001
Springer
Volumetric images of small mortar samples under load are acquired by X-ray microtomography. The images are binarized at many different threshold values, and over a million connecte...
MICAI
2005
Springer
14 years 1 months ago
2005
Springer
In Multi-agent based simulation (MABS) systems, computational models are built as multi-agent systems (MAS). Replication of these models can contribute to improve the reliability o...
LATIN
2010
Springer
13 years 6 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...