Results 1  10
of
2,450,148
Efficient Approximation Schemes for Geometric Problems?⋆
"... Abstract. An EPTAS (efficient PTAS) is an approximation scheme where ǫ does not appear in the exponent of n, i.e., the running time is f(ǫ) ·nc. We use parameterized complexity to investigate the possibility of improving the known approximation schemes for certain geometric problems to EPTAS. Answe ..."
Abstract
 Add to MetaCart
Abstract. An EPTAS (efficient PTAS) is an approximation scheme where ǫ does not appear in the exponent of n, i.e., the running time is f(ǫ) ·nc. We use parameterized complexity to investigate the possibility of improving the known approximation schemes for certain geometric problems to EPTAS
A more Efficient Approximation Scheme for Tree Alignment
 SIAM Journal on Computing
, 1997
"... Abstract. We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the literature, the basic approach of our algorithm is to partition the given tree into overlapping components of a con ..."
Abstract

Cited by 26 (5 self)
 Add to MetaCart
Abstract. We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the literature, the basic approach of our algorithm is to partition the given tree into overlapping components of a
An Efficient Approximation Scheme for Data Mining Tasks
, 2001
"... We investigate the use of biased sampling according to the density of the dataset, to speed up the operation of general data mining tasks, such as clustering and outlier detection in large multidimensional datasets. In densitybiased sampling, the probability that a given point will be included in ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
over simple random sampling. We describe our approach in detail, we analytically evaluate it, and show how it can be optimized for approximate clustering and outlier detection. Finally we present a thorough experimental evaluation of the proposed method, applying densitybiased sampling on real
A Simple Efficient Approximation Scheme for the Restricted Shortest Path Problem
 Operations Research Letters
, 1999
"... In this short paper we give a very simple fully polynomial approximation scheme for the restricted shortest path problem. The complexity of this fflapproximation scheme is O(jEjn(loglog n + 1=ffl)), which improves Hassin's original result [Has92] by a factor of n. Furthermore, this complex ..."
Abstract

Cited by 73 (2 self)
 Add to MetaCart
In this short paper we give a very simple fully polynomial approximation scheme for the restricted shortest path problem. The complexity of this fflapproximation scheme is O(jEjn(loglog n + 1=ffl)), which improves Hassin's original result [Has92] by a factor of n. Furthermore
Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times ∗
"... We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job must be processed without interruption for a given amount of time on any one of the m machines. In addition, each job has a release date, when it becomes available for processing, and, ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
, after completing its processing, requires an additional delivery time. The objective is to minimize the time by which all jobs are delivered. In the notation of Graham et al. [4], this problem is noted P rjLmax. We develop a polynomial time approximation scheme whose running time depends only linearly
Spaceefficient approximation scheme for circular earth mover distance
 In LATIN
, 2012
"... Abstract. The Earth Mover Distance (EMD) between point sets A and B is the minimum cost of a bipartite matching between A and B. EMD is an important measure for estimating similarities between objects with quantifiable features and has important applications in several areas including computer visi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
vision. The streaming complexity of approximating EMD between point sets in a twodimensional discretized grid is an important open problem proposed in [8, 9]. We study the problem of approximating EMD in the streaming model, when points lie on a discretized circle. Computing the EMD in this setting
Approximate Riemann Solvers, Parameter Vectors, and Difference Schemes
 J. COMP. PHYS
, 1981
"... Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution ..."
Abstract

Cited by 959 (2 self)
 Add to MetaCart
Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution
The space complexity of approximating the frequency moments
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
, 1996
"... The frequency moments of a sequence containing mi elements of type i, for 1 ≤ i ≤ n, are the numbers Fk = �n i=1 mki. We consider the space complexity of randomized algorithms that approximate the numbers Fk, when the elements of the sequence are given one by one and cannot be stored. Surprisingly, ..."
Abstract

Cited by 855 (12 self)
 Add to MetaCart
The frequency moments of a sequence containing mi elements of type i, for 1 ≤ i ≤ n, are the numbers Fk = �n i=1 mki. We consider the space complexity of randomized algorithms that approximate the numbers Fk, when the elements of the sequence are given one by one and cannot be stored. Surprisingly
Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks
 SIGCOMM'05
, 2005
"... Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks ..."
Abstract

Cited by 477 (9 self)
 Add to MetaCart
Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks
Results 1  10
of
2,450,148