7106 search results - page 318 / 1422 » Restricted Complexity, General Complexity |
125
click to vote
DCG
2006
15 years 4 months ago
2006
In a 1967 paper, Banchoff stated that a certain type of polyhedral curvature, that applies to all finite polyhedra, was zero at all vertices of an odd-dimensional polyhedral manifo...
122
click to vote
IEEECIT
2010
IEEE
15 years 3 months ago
2010
IEEE
—Peer-to-peer computing, involving the participation of thousands of general purpose, public computers, has established itself as a viable paradigm for executing looselycoupled, ...
168
click to vote
LICS
2010
IEEE
15 years 2 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
186
click to vote
PKDD
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achi...
149
click to vote
WACV
2008
IEEE
15 years 11 months ago
2008
IEEE
In the traditional mixture of Gaussians background model, the generating process of each pixel is modeled as a mixture of Gaussians over color. Unfortunately, this model performs ...