Sciweavers

539 search results - page 100 / 108
» Observability of Switched Linear Systems
Sort
View
FOCS
2009
IEEE
14 years 3 months ago
The Complexity of Rationalizing Network Formation
— 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...
Shankar Kalyanaraman, Christopher Umans
ATAL
2008
Springer
13 years 10 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
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...
NIPS
1996
13 years 10 months ago
A Model of Recurrent Interactions in Primary Visual Cortex
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...
Emanuel Todorov, Athanassios Siapas, David Somers
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
14 years 3 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
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...
Carl Olsson, Magnus Oskarsson
CVPR
2009
IEEE
15 years 3 months ago
Learning General Optical Flow Subspaces for Egomotion Estimation and Detection of Motion Anomalies
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),...