14699 search results - page 332 / 2940 » Complexity and Cognitive Computing |
127
Voted
LATIN
1998
Springer
15 years 8 months ago
1998
Springer
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
139
click to vote
MFCS
1997
Springer
15 years 8 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
175
click to vote
STACS
1994
Springer
15 years 8 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
154
click to vote
CONEXT
2007
ACM
15 years 8 months ago
2007
ACM
Protocol extensions for a mobile Internet have been developed within the IETF, but a standard design of mobile multicast is still awaited. Multicast routing, when adapting its dis...
139
Voted
BMVC
2002
15 years 7 months ago
2002
The fusion of images is the process of combining two or more images into a single image retaining important features from each. Fusion is an important technique within many dispar...