933 search results - page 80 / 187 » Monotone Complexity of a Pair |
IJCNN
2000
IEEE
14 years 1 months ago
2000
IEEE
The choice of transfer functions may strongly influence complexity and performance of neural networks used in classification and approximation tasks. A taxonomy of activation an...
ASIACRYPT
2006
Springer
14 years 18 days ago
2006
Springer
In this paper, we describe generic attacks on unbalanced Feistel schemes with contracting functions. These schemes are used to construct pseudo-random permutations from kn bits to ...
ACID
2006
13 years 10 months ago
2006
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
APPINF
2003
13 years 10 months ago
2003
In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...