Sciweavers

1261 search results - page 37 / 253
» Approximation algorithms for aligning points
Sort
View
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
15 years 7 months ago
How good is the Chord algorithm?
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...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...
JCB
2007
107views more  JCB 2007»
14 years 9 months ago
Effects of Long-Range Correlations in DNA on Sequence Alignment Score Statistics
Long-range correlations in genomic base composition are a ubiquitous statistical feature among many eukaryotic genomes. In this article, these correlations are shown to substantia...
Philipp W. Messer, Ralf Bundschuh, Martin Vingron,...
90
Voted
CISS
2008
IEEE
15 years 4 months ago
Optimizing wireless networks for heterogeneous spatial loads
—Large-scale wireless networks must be designed such that there are no gaps in coverage. It is also desirable to minimize the number of access points used in order to minimize th...
Balaji Rengarajan, Gustavo de Veciana
APPROX
2005
Springer
131views Algorithms» more  APPROX 2005»
15 years 3 months ago
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
Jan Remy, Angelika Steger
SIAMCO
2002
121views more  SIAMCO 2002»
14 years 9 months ago
Consistent Approximations and Approximate Functions and Gradients in Optimal Control
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
Olivier Pironneau, Elijah Polak