3702 search results - page 280 / 741 » All Pairings Are in a Group |
154
Voted
CSCLP
2005
Springer
16 years 8 days ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...
175
Voted
ICIAR
2005
Springer
16 years 8 days ago
2005
Springer
Efficient matching methods are crucial in Image Processing. In the present paper we outline a novel algorithm of ”stable marriages” that is also fair and globally satisfactory ...
179
click to vote
PKDD
2005
Springer
16 years 7 days ago
2005
Springer
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
143
click to vote
CRYPTO
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. In this paper, we study the existence of multicollisions in iterated hash functions. We show that finding multicollisions, i.e. r-tuples of messages that all hash to the...
167
click to vote
DAGM
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. We consider the task of stereo-reconstruction under the following fairly broad assumptions. A single and continuously shaped object is captured by two uncalibrated camera...