417 search results - page 23 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
ALT
1999
Springer
14 years 22 days ago
1999
Springer
We are concerned with the problem of sequential prediction using a givenhypothesis class of continuously-manyprediction strategies. An e ectiveperformance measure is the minimax re...
DIALM
2003
ACM
14 years 1 months ago
2003
ACM
A common way of storing spatio-temporal information about mobile devices is in the form of a 3D (2D geography + time) trajectory. We argue that when cellular phones and Personal D...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
ECCC
2011
13 years 3 months ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...