134 search results - page 24 / 27 » On Constant Time Approximation of Parameters of Bounded Degr... |
CCCG
2008
14 years 11 months ago
2008
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
118
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
RECOMB
2006
Springer
15 years 9 months ago
2006
Springer
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
106
click to vote
PODS
2001
ACM
15 years 9 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
112
click to vote
SODA
2010
ACM
15 years 6 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...