335 search results - page 30 / 67 » On the approximation order of tangent estimators |
115
click to vote
ESANN
2001
15 years 3 months ago
2001
We develop improved risk bounds for function estimation with models such as single hidden layer neural nets, using a penalized least squares criterion to select the size of the mod...
179
click to vote
SIGMOD
2002
ACM
16 years 2 months ago
2002
ACM
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
111
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
The challenge we address is to reason about projected resource usage within a hierarchical task execution framework in order to improve agent effectiveness. Specifically, we seek ...
178
click to vote
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
Sketching techniques can provide approximate answers to aggregate queries either for data-streaming or distributed computation. Small space summaries that have linearity propertie...
104
click to vote
STOC
2002
ACM
16 years 2 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...