1879 search results - page 164 / 376 » Computational geometry algorithms library |
155
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
166
click to vote
ISSAC
1992
Springer
15 years 9 months ago
1992
Springer
Abstract. Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The well-known...
115
Voted
COCOON
2006
Springer
15 years 8 months ago
2006
Springer
We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length....
147
Voted
NIPS
2000
15 years 6 months ago
2000
An on-line recursive algorithm for training support vector machines, one vector at a time, is presented. Adiabatic increments retain the KuhnTucker conditions on all previously se...
121
Voted
ISQED
2005
IEEE
15 years 10 months ago
2005
IEEE
Layout migration has re-emerged as an important task due to the increasing use of library hard intellectual properties. While recent advances of migration tools have accommodated ...