In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
The current paper presents research that investigates those factors that affect the recruitment and retention of women and African Americans in the computing sciences. We begin by...
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
— In this paper, the safety control problem for a class of hybrid systems with disturbance inputs and imperfect continuous state information is considered. Under the assumption t...
We consider the problem of detecting a large number of different object classes in cluttered scenes. Traditional approaches require applying a battery of different classifiers to ...
Antonio B. Torralba, Kevin P. Murphy, William T. F...