Sciweavers

76 search results - page 1 / 16
» On a Network Generalization of the Minmax Theorem
Sort
View
ICALP
2009
Springer
14 years 5 months ago
On a Network Generalization of the Minmax Theorem
We consider graphical games in which edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. We give a si...
Constantinos Daskalakis, Christos H. Papadimitriou
JCT
2008
120views more  JCT 2008»
13 years 4 months ago
Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
Tamás Király, Lap Chi Lau
FOCS
2006
IEEE
13 years 10 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
ENGL
2007
148views more  ENGL 2007»
13 years 4 months ago
A General Reflex Fuzzy Min-Max Neural Network
—“A General Reflex Fuzzy Min-Max Neural Network” (GRFMN) is presented. GRFMN is capable to extract the underlying structure of the data by means of supervised, unsupervised a...
Abhijeet V. Nandedkar, Prabir Kumar Biswas
VLSISP
2002
124views more  VLSISP 2002»
13 years 4 months ago
Agglomerative Learning Algorithms for General Fuzzy Min-Max Neural Network
In this paper two agglomerative learning algorithms based on new similarity measures defined for hyperbox fuzzy sets are proposed. They are presented in a context of clustering and...
Bogdan Gabrys