1920 search results - page 77 / 384 » The Complexity of the A B C Problem |
178
click to vote
IJCAI
1989
15 years 7 months ago
1989
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de sign task takes as input the specifications of the desired functions of a device...
163
Voted
SBCCI
2006
ACM
16 years 2 days ago
2006
ACM
Platform-based design is a method to implement complex SoCs, avoiding chip design from scratch. A promising evolution of platform-based design are MPSoC. Such generic architecture...
160
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We propose a new set of rotationally and translationally invariant features for image or pattern recognition and classification. The new features are cubic polynomials in the pix...
177
Voted
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
172
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...