349 search results - page 44 / 70 » Covering a Set of Points with a Minimum Number of Lines |
ESA
2008
Springer
13 years 9 months ago
2008
Springer
We present a new streaming algorithm for maintaining an -kernel of a point set in Rd using O((1/(d-1)/2 ) log(1/)) space. The space used by our algorithm is optimal up to a small ...
DAM
2008
13 years 8 months ago
2008
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique...
CIKM
1998
Springer
14 years 4 days ago
1998
Springer
An important investigation of time series involves searching for \movement" patterns, such as \going up" or \going down" or some combinations of them. Movement patt...
COMPGEOM
1994
ACM
14 years 9 hour ago
1994
ACM
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...