8 search results - page 1 / 2 » Upper and Lower I O Bounds for Pebbling r-Pyramids |
IWOCA
2010
Springer
12 years 11 months ago
2010
Springer
JCSS
2002
13 years 4 months ago
2002
We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U; find a consecu...
CIAC
2010
Springer
13 years 9 months ago
2010
Springer
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
JUCS
2008
13 years 4 months ago
2008
: A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ru...