Sciweavers

SODA
2000
ACM
85views Algorithms» more  SODA 2000»
13 years 6 months ago
Real scaled matching
Real Scaled Matching is the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scale...
Amihood Amir, Ayelet Butman, Moshe Lewenstein
SODA
2000
ACM
125views Algorithms» more  SODA 2000»
13 years 6 months ago
Approximation algorithms for projective clustering
We consider the following two instances of the projective clustering problem: Given a set
Pankaj K. Agarwal, Cecilia Magdalena Procopiuc
SODA
2000
ACM
99views Algorithms» more  SODA 2000»
13 years 6 months ago
Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling
Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramo...