5183 search results - page 275 / 1037 » The Complexity of Distributions |
182
click to vote
EJC
2002
15 years 6 months ago
2002
Given a Newtonian coalgebra we associate to it a chain complex. The homology groups of this Newtonian chain complex are computed for two important Newtonian coalgebras arising in ...
154
click to vote
AIPS
2006
15 years 8 months ago
2006
Classical planning algorithms require that their operators be simple in order for planning to be tractable. However, the complexities of real world domains suggest that, in order ...
154
click to vote
NIPS
2007
15 years 8 months ago
2007
We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of C...
154
click to vote
IPPS
2006
IEEE
16 years 19 days ago
2006
IEEE
The execution of a complex task in any environment requires planning. Planning is the process of constructing an activity graph given by the current state of the system, a goal st...
123
click to vote
MA
2010
Springer
15 years 5 months ago
2010
Springer
We equip the polytope of n × n Markov matrices with the normalized trace of the Lebesgue measure of Rn2 . This probability space provides random Markov matrices, with i.i.d. rows...