3694 search results - page 116 / 739 » Stochastic complexity in learning |
STOC
2009
ACM
14 years 10 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
CCECE
2009
IEEE
14 years 4 months ago
2009
IEEE
The inverse diffusion problems deal with the estimation of many crucial parameters such as the diffusion coefficient, source properties, and boundary conditions. Such algorithms ...
IJCAI
1997
13 years 11 months ago
1997
cal maps provide a useful abstraction for robotic navigation and planning. Although stochastic mapscan theoreticallybe learned using the Baum-Welch algorithm,without strong prior ...
SOCA
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper we focus on how Quality of Service guarantees are provided to virtualised applications in the Cloud Computing infrastructure that is being developed in the context of...
COCO
1994
Springer
14 years 2 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...