2354 search results - page 177 / 471 » Randomness, Stochasticity and Approximations |
123
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
137
click to vote
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
Denote by an -component a connected b-uniform hypergraph with k edges and k(b - 1) - vertices. We prove that the expected number of creations of -component during a random hypergr...
125
Voted
AIPS
2004
15 years 6 months ago
2004
We describe and evaluate a system for learning domainspecific control knowledge. In particular, given a planning domain, the goal is to output a control policy that performs well ...
129
Voted
FOCM
2007
15 years 4 months ago
2007
Abstract. We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in Rn and related problems of complex integration and opt...
143
Voted
TSP
2008
15 years 3 months ago
2008
This paper develops and compares the maximum a posteriori (MAP) and minimum mean-square error (MMSE) estimators for spherically contoured multivariate Laplace random vectors in add...