192 search results - page 34 / 39 » Complexity Bounds for Regular Games |
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
Inspired by co-training, many multi-view semi-supervised kernel methods implement the following idea: find a function in each of multiple Reproducing Kernel Hilbert Spaces (RKHSs)...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
SIGGRAPH
2010
ACM
14 years 1 months ago
2010
ACM
Simulating fluids based on vortex filaments is highly attractive for the creation of special effects because it gives artists full control over the simulation using familiar too...
COCO
1998
Springer
14 years 24 days ago
1998
Springer
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
COCO
2008
Springer
13 years 10 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...