Sciweavers

Share
8 search results - page 1 / 2
» Upper and Lower I O Bounds for Pebbling r-Pyramids
Sort
View
IWOCA
2010
Springer
195views Algorithms» more  IWOCA 2010»
10 years 8 months ago
Upper and Lower I/O Bounds for Pebbling r-Pyramids
Desh Ranjan, John E. Savage, Mohammad Zubair
JCSS
2002
95views more  JCSS 2002»
11 years 29 days ago
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
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...
Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao
CIAC
2010
Springer
252views Algorithms» more  CIAC 2010»
11 years 6 months ago
On the Number of Higher Order Delaunay Triangulations
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...
Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira
COMPGEOM
2009
ACM
11 years 7 months ago
Coresets for polytope distance
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...
Bernd Gärtner, Martin Jaggi
JUCS
2008
158views more  JUCS 2008»
11 years 1 months ago
A Linear Time Approximation Algorithm for Ruler Folding Problem
: 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...
Ali Nourollah, Mohammadreza Razzazi
books