37 search results - page 2 / 8 » The Complexity of Orbits of Computably Enumerable Sets |
ICIP
2003
IEEE
14 years 7 months ago
2003
IEEE
Image Processing and Computer Vision applications often require finding a particular pattern in a set of images. The task involves finding appearances of a given pattern in an ima...
COMMA
2006
13 years 7 months ago
2006
The hitherto most abstract, and hence general, argumentation system, is the one described by Dung in a paper from 1995. This framework does not allow for joint attacks on arguments...
ICCS
2003
Springer
13 years 11 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
RECOMB
2006
Springer
14 years 6 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...
VLSID
2008
IEEE
14 years 6 months ago
2008
IEEE
Today's customizable processors allow the designer to augment the base processor with custom accelerators. By choosing appropriate set of accelerators, designer can significa...