2714 search results - page 476 / 543 » Approximation Schemes for Scheduling |
104
Voted
WADS
2005
Springer
15 years 6 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
SCN
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties...
94
Voted
WAOA
2004
Springer
15 years 6 months ago
2004
Springer
A prevailing feature of mobile telephony systems is that the location of a mobile user may be unknown. Therefore, when the system has to establish a call between users, it may nee...
SMA
2003
ACM
15 years 5 months ago
2003
ACM
We present a method to estimate the in/out function of a closed surface represented by an unorganized set of data points. From the in/out function, we compute an approximation of ...
109
click to vote
COLT
2003
Springer
15 years 5 months ago
2003
Springer
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...