960 search results - page 54 / 192 » Optimal Monte Carlo Algorithms |
STOC
1996
ACM
13 years 12 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
BMVC
2000
13 years 9 months ago
2000
We tackle the problem of object recognition using a Bayesian approach. A marked point process [1] is used as a prior model for the (unknown number of) objects. A sample is generat...
NIPS
1998
13 years 9 months ago
1998
We propose a novel strategy for training neural networks using sequential Monte Carlo algorithms. This global optimisation strategy allows us to learn the probability distribution...
IPL
2007
13 years 7 months ago
2007
The longest increasing circular subsequence (LICS) of a list is considered. A Monte-Carlo algorithm to compute it is given which has worst case execution time O(n3/2 log n) and st...
IJBC
2008
13 years 6 months ago
2008
Fractional generalizations of the Poisson process and branching Furry process are considered. The link between characteristics of the processes, fractional differential equations ...