— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
A general feature of the cerebral cortex is its massive interconnectivity-ithas been estimatedanatomically 15 that cortical neurons receive on the order of 10,000 synapses, the ma...
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
This paper deals with estimation of dense optical flow
and ego-motion in a generalized imaging system by exploiting
probabilistic linear subspace constraints on the flow.
We dea...
Richard Roberts (Georgia Institute of Technology),...