1554 search results - page 257 / 311 » Parameterized Complexity and Approximation Algorithms |
JACM
2007
14 years 10 months ago
2007
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
106
click to vote
ECCV
2002
Springer
16 years 3 days ago
2002
Springer
Visual sensors provide exclusively uncertain and partial knowledge of a scene. In this article, we present a suitable scene knowledge representation that makes integration and fusi...
87
Voted
STOC
2009
ACM
15 years 11 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
101
Voted
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
104
click to vote
UAI
2004
14 years 11 months ago
2004
We address the problem of unsupervised learning of complex articulated object models from 3D range data. We describe an algorithm whose input is a set of meshes corresponding to d...