1071 search results - page 87 / 215 » Theories of Automatic Structures and Their Complexity |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
SAGT
2010
Springer
13 years 6 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
FOCM
2011
12 years 11 months ago
2011
The theory of intersection homology was developed to study the singularities of a topologically stratified space. This paper incorporates this theory into the already developed f...
CVPR
2003
IEEE
14 years 10 months ago
2003
IEEE
We present a fast, robust and automatic method for computing central paths through tubular structures for application to virtual endoscopy. The key idea is to utilize a medial sur...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
The Web as a global information space is developing from a Web of documents to a Web of data. This development opens new ways for addressing complex information needs. Search is n...