10608 search results - page 657 / 2122 » Complexity of O'Hara's Algorithm |
204
click to vote
DGCI
2006
Springer
15 years 9 months ago
2006
Springer
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. In [1], an algorithm which perform...
153
click to vote
COLT
2008
Springer
15 years 9 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
178
click to vote
LWA
2008
15 years 8 months ago
2008
With increasing complexity of manufacturing processes, the volume of data that has to be evaluated rises accordingly. The complexity and data volume make any kind of manual data a...
156
click to vote
UAI
2001
15 years 8 months ago
2001
In this paper, we present an efficient algorithm for performing stepwise selection in the class of decomposable models. We focus on the forward selection procedure, but we also di...
254
click to vote
UAI
1997
15 years 8 months ago
1997
Bayesian networks provide a modeling language and associated inference algorithm for stochastic domains. They have been successfully applied in a variety of medium-scale applicati...