141 search results - page 9 / 29 » Self-improving Algorithms for Convex Hulls |
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
95
Voted
PR
2007
14 years 9 months ago
2007
Skew estimation and page segmentation are the two closely related processing stages for document image analysis. Skew estimation needs proper page segmentation, especially for doc...
COLT
2005
Springer
15 years 3 months ago
2005
Springer
We study the problem of learning a kernel which minimizes a regularization error functional such as that used in regularization networks or support vector machines. We consider thi...
COLT
2010
Springer
14 years 7 months ago
2010
Springer
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...
105
click to vote
COMPGEOM
1996
ACM
15 years 1 months ago
1996
ACM
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...