159 search results - page 19 / 32 » Computational Complexity of Fundamental Problems in Social C... |
114
click to vote
NIPS
2000
15 years 1 months ago
2000
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
104
click to vote
IPPS
2010
IEEE
14 years 9 months ago
2010
IEEE
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...
104
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
131
click to vote
AAAI
2012
13 years 2 months ago
2012
This paper addresses the problem of automated advice provision in settings that involve repeated interactions between people and computer agents. This problem arises in many real ...
SIGECOM
2006
ACM
15 years 5 months ago
2006
ACM
We study coalitional games where the value of cooperation among the agents are solely determined by the attributes the agents possess, with no assumption as to how these attribute...