Sciweavers

250 search results - page 27 / 50
» Constructing a Class of Symmetric Graphs
Sort
View
NIPS
1997
13 years 9 months ago
Minimax and Hamiltonian Dynamics of Excitatory-Inhibitory Networks
A Lyapunov function for excitatory-inhibitory networks is constructed. The construction assumes symmetric interactions within excitatory and inhibitory populations of neurons, and...
H. Sebastian Seung, Tom J. Richardson, J. C. Lagar...
DCG
2007
125views more  DCG 2007»
13 years 8 months ago
Alcoved Polytopes, I
The aim of this paper is to initiate the study of alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many clas...
Thomas Lam, Alexander Postnikov
CONCUR
2006
Springer
14 years 6 days ago
Event Structure Semantics for Nominal Calculi
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...
Roberto Bruni, Hernán C. Melgratti, Ugo Mon...
FOCS
2009
IEEE
14 years 3 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
AI
2004
Springer
13 years 8 months ago
Efficient learning equilibrium
Efficient Learning Equilibrium (ELE) is a natural solution concept for multi-agent encounters with incomplete information. It requires the learning algorithms themselves to be in ...
Ronen I. Brafman, Moshe Tennenholtz