69 search results - page 5 / 14 » Covering and Packing in Linear Space |
MP
2007
14 years 9 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
TCS
2010
14 years 7 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
106
Voted
COLT
1999
Springer
15 years 1 months ago
1999
Springer
—Support vector (SV) machines are linear classifiers that use the maximum margin hyperplane in a feature space defined by a kernel function. Until recently, the only bounds on th...
139
click to vote
POPL
2003
ACM
15 years 9 months ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
COLT
2000
Springer
15 years 1 months ago
2000
Springer
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...