485 search results - page 52 / 97 » Iterative Bounding LAO |
88
Voted
COLT
2007
Springer
15 years 2 months ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
85
Voted
VISSYM
2007
15 years 20 days ago
2007
One of the most common visualization tasks is the extraction of significant boundaries, often performed with isosurfaces or level set segmentation. Isosurface extraction is simple...
NIPS
2007
14 years 11 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
76
Voted
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
In this paper, frequency estimation of a twodimensional (2D) cisoid in the presence of additive white Gaussian noise is addressed. By utilizing the rank-one property of the 2D noi...
87
Voted
IPL
2008
14 years 10 months ago
2008
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...