Sciweavers

3475 search results - page 348 / 695
» Backbones in Optimization and Approximation
Sort
View
NECO
2008
112views more  NECO 2008»
15 years 6 months ago
Second-Order SMO Improves SVM Online and Active Learning
Iterative learning algorithms that approximate the solution of support vector machines (SVMs) have two potential advantages. First, they allow for online and active learning. Seco...
Tobias Glasmachers, Christian Igel
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
15 years 6 months ago
The Euclidean Orienteering Problem Revisited
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
Ke Chen 0006, Sariel Har-Peled
CAD
2005
Springer
15 years 6 months ago
Industrial geometry: recent advances and applications in CAD
Industrial Geometry aims at unifying existing and developing new methods and algorithms for a variety of application areas with a strong geometric component. These include CAD, CA...
Helmut Pottmann, Stefan Leopoldseder, Michael Hofe...
CGF
2004
108views more  CGF 2004»
15 years 6 months ago
Interference Detection for Subdivision Surfaces
Accurate and robust interference detection and ray-tracing of subdivision surfaces requires safe linear approximations. Approximation of the limit surface by the subdivided contro...
Xiaobin Wu, Jörg Peters
CORR
2004
Springer
168views Education» more  CORR 2004»
15 years 6 months ago
Estimating Genome Reversal Distance by Genetic Algorithm
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
Andy Auyeung, Ajith Abraham