105 search results - page 11 / 21 » Linear Time Algorithm for Weak Parity Games |
CONCUR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
FOCS
1999
IEEE
14 years 2 days ago
1999
IEEE
Mixtures of Gaussians are among the most fundamental and widely used statistical models. Current techniques for learning such mixtures from data are local search heuristics with w...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
Boosting is a remarkably simple and flexible classification algorithm with widespread applications in computer vision. However, the application of boosting to nonEuclidean, infini...
SP
1996
IEEE
13 years 12 months ago
1996
IEEE
We present new results on a distributable changedetection method inspired by the natural immune system. A weakness in the original algorithm was the exponential cost of generating...