676 search results - page 58 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
180
click to vote
ML
2012
ACM
14 years 1 months ago
2012
ACM
Bayesian learning, widely used in many applied data-modeling problems, is often accomplished with approximation schemes because it requires intractable computation of the posterio...
160
click to vote
NIPS
2004
15 years 7 months ago
2004
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...
160
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
149
click to vote
ZUM
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We describe a method for combining formal program development with a disciplined and documented way of introducing realistic compromises, for example necessitated by reso...
164
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
Recent advances in large-margin classification of data residing in general metric spaces (rather than Hilbert spaces) enable classification under various natural metrics, such as ...