9842 search results - page 1325 / 1969 » The Complexity of the Matching-Cut Problem |
185
Voted
CGF
2004
15 years 7 months ago
2004
We present a technique for creating a smoothly varying sequence of procedural textures that interpolates between arbitrary input samples of texture. This texture transformation us...
237
Voted
CORR
2004
Springer
15 years 7 months ago
2004
Springer
Social insect societies and more specifically ant colonies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organi...
228
Voted
IDA
2000
Springer
15 years 7 months ago
2000
Springer
When high-dimensional data vectors are visualized on a two- or three-dimensional display, the goal is that two vectors close to each other in the multi-dimensional space should als...
214
Voted
JCSS
2000
15 years 7 months ago
2000
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
232
click to vote
JOC
2000
15 years 7 months ago
2000
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...