Sciweavers

3096 search results - page 106 / 620
» The Generalized FITC Approximation
Sort
View
TSP
2010
13 years 3 months ago
Quasi-interpolation by means of filter-banks
We consider the problem of approximating a regular function f(t) from its samples, f(nT), taken in a uniform grid. Quasi-interpolation schemes approximate f(t) with a dilated versi...
Gerardo Pérez-Villalón
ESA
2004
Springer
98views Algorithms» more  ESA 2004»
14 years 2 months ago
Competitive Online Approximation of the Optimal Search Ratio
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...
Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elm...
GCB
2004
Springer
91views Biometrics» more  GCB 2004»
14 years 2 months ago
A Method for Fast Approximate Searching of Polypeptide Structures in the PDB
: The main contribution of this paper is a novel approach for fast searching in huge structural databases like the PDB. The data structure is based on an adaption of the generalize...
Hanjo Täubig, Arno Buchner, Jan Griebsch
PPSN
2004
Springer
14 years 2 months ago
Constrained Evolutionary Optimization by Approximate Ranking and Surrogate Models
Abstract. The paper describes an evolutionary algorithm for the general nonlinear programming problem using a surrogate model. Surrogate models are used in optimization when model ...
Thomas Philip Runarsson
ICALP
2010
Springer
14 years 1 months ago
On Approximate Horn Formula Minimization
The minimization problem for Horn formulas is to find a Horn formula equivalent to a given Horn formula, using a minimum number of clauses. A 2log1−ǫ (n) -inapproximability re...
Amitava Bhattacharya, Bhaskar DasGupta, Dhruv Muba...