Given a graph G, an identifying code D V (G) is a vertex set such that for any two distinct vertices v1, v2 V (G), the sets N[v1] D and N[v2] D are distinct and nonempty (here...
In 1993 our group at the MIT Artificial Intelligence Laboratory began a humanoid robotics project aimed at constructing a robot for use in exploring theories of human intelligence...
Bryan Adams, Cynthia Breazeal, Rodney A. Brooks, B...
In this paper, a discriminative representation method of head images is proposed, which is based on parts and poses for identity-independent head pose estimation. Head images are ...
We examine the generic local and global rigidity of various graphs in Rd . Bruce Hendrickson showed that some necessary conditions for generic global rigidity are (d + 1)-connected...
Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model ...
Johannes Gehrke, Venkatesh Ganti, Raghu Ramakrishn...