We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
Abstract- This paper presents a new operator for genetic algorithms that enhances their convergence in the case of nonlinear problems with nonlinear equality constraints. The propo...
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
Jochem H. Rutgers, Pascal T. Wolkotte, Philip K. F...
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...