3415 search results - page 151 / 683 » Lower Bounds for Kernelizations |
160
click to vote
COLT
1999
Springer
15 years 8 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...
270
click to vote
STOC
2012
ACM
13 years 7 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
102
click to vote
CLASSIFICATION
2008
15 years 4 months ago
2008
Abstract: Bounds of association coefficients for binary variables are derived using the arithmetic-geometric-harmonic mean inequality. More precisely, it is shown which presence/ab...
134
click to vote
WDAG
2009
Springer
15 years 11 months ago
2009
Springer
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
140
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...