4047 search results - page 243 / 810 » The Discrete Basis Problem |
139
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
Given a point set P R2 , a subset Q P is an -kernel of P if for every slab W containing Q, the (1+)-expansion of W also contains P. We present a data-stream algorithm for mainta...
149
click to vote
COCOA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
163
click to vote
COMPGEOM
2001
ACM
15 years 10 months ago
2001
ACM
This paper addresses the problem of lossy compression of arrangements. Given an arrangement of n lines in the plane, we show how to construct another arrangement consisting of man...
204
click to vote
DGCI
2000
Springer
15 years 10 months ago
2000
Springer
We consider the problem of finding the best match for a given query shape among candidate shapes stored in a shape base. This is central to a wide range of applications, such as, d...
181
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...