76 search results - page 13 / 16 » On a Network Generalization of the Minmax Theorem |
IJCNN
2000
IEEE
14 years 8 hour ago
2000
IEEE
Many machine learning algorithms can be formulated as the minimization of a training criterion which involves (1) \training errors" on each training example and (2) some hype...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
IICAI
2007
13 years 9 months ago
2007
We introduce a neural network with associative memory and a continuous topology, i.e. its processing units are elements of a continuous metric space and the state space is Euclide...
TON
2010
13 years 6 months ago
2010
—This paper considers the problem of pricing and transmission scheduling for an Access Point (AP) in a wireless network, where the AP provides service to a set of mobile users. T...
ICALP
1993
Springer
13 years 11 months ago
1993
Springer
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...