727 search results - page 68 / 146 » One line and n points |
ICALP
2003
Springer
15 years 3 months ago
2003
Springer
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...
102
click to vote
FAW
2008
Springer
14 years 11 months ago
2008
Springer
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
ISAAC
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
ECCV
2006
Springer
15 years 12 months ago
2006
Springer
Abstract. In Computer Vision applications, one usually has to work with uncertain data. It is therefore important to be able to deal with uncertain geometry and uncertain transform...
APPML
2008
14 years 10 months ago
2008
We provide a complete answer to the problem which consists in finding an unpointed convex cone lying at minimal bounded Pompeiu-Hausdorff distance from a pointed one. We give also...