2412 search results - page 3 / 483 » Which Problems Have Strongly Exponential Complexity |
CPM
2006
Springer
14 years 8 days ago
2006
Springer
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
CSL
2008
Springer
13 years 10 months ago
2008
Springer
Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of in...
ICCBR
2007
Springer
14 years 13 days ago
2007
Springer
The performance of a Case-Based Reasoning system relies on the integrity of its case base but in real life applications the available data used to construct the case base invariabl...