3630 search results - page 513 / 726 » Fast Marching Methods |
178
click to vote
JMLR
2010
14 years 10 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
135
Voted
JMLR
2010
14 years 10 months ago
2010
L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be effective in problem domains when noisy features are present. However, the L1 penalty...
153
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
—For a long time, signal processing applications, and most particularly detection and parameter estimation methods, have relied on the limiting behaviour of test statistics and e...
145
Voted
FS
2011
14 years 7 months ago
2011
Abstract We derive an explicit representation of the transitions of the Heston stochastic volatility model and use it for fast and accurate simulation of the model. Of particular i...
144
click to vote
PAMI
2012
13 years 6 months ago
2012
—We study the problem of approximating a 3D solid with a union of overlapping spheres. In comparison with a stateof-the-art approach, our method offers more than an order of magn...