480 search results - page 42 / 96 » Approximate and exact algorithms for the fixed-charge knapsa... |
SDM
2007
SIAM
13 years 10 months ago
2007
SIAM
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
LATIN
2010
Springer
14 years 3 months ago
2010
Springer
Given a set S of segments in the plane, a polygon P is an intersecting polygon of S if every segment in S intersects the interior or the boundary of P. The problem MPIP of computi...
SISAP
2008
IEEE
14 years 3 months ago
2008
IEEE
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
ISSAC
2007
Springer
14 years 3 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...