3875 search results - page 443 / 775 » Approximation algorithms for the 0-extension problem |
173
click to vote
AAIM
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we study how to, given a set of pre-routed requests in an all-optical network and a set of wavelengths available on each link, assign a subset of requests with maxim...
177
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...
184
click to vote
AAECC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
181
click to vote
JMLR
2006
15 years 6 months ago
2006
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
178
click to vote
ICALP
2004
Springer
16 years 3 days ago
2004
Springer
We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better ...