Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 51 matches
- 1993
- Bernd Fischer, Jan Modersitzki:
An algorithm for complex linear approximation based on semi-infinite programming. Numer. Algorithms 5(6): 287-297 (1993) - I. J. Anderson, M. G. Cox, J. C. Mason:
Tensor-product spline interpolation to data on or near a family of lines. Numer. Algorithms 5(4): 193-204 (1993) - Claudio Barone, Ezio Venturino:
On the numerical evaluation of Cauchy transforms. Numer. Algorithms 5(9): 429-436 (1993) - Ian Barrodale, R. Kuwahara, R. Poeckert, D. Skea:
Side-scan sonar image processing using thin plate splines and control point matching. Numer. Algorithms 5(2): 85-98 (1993) - Jean-Paul Berrut:
A closed formula for the čebyšev barycentric weights of optimal approximation in H2. Numer. Algorithms 5(3): 155-163 (1993) - Carl de Boor:
On the evaluation of box splines. Numer. Algorithms 5(1): 5-23 (1993) - Ken W. Bosworth, Upmanu Lall:
AnL1 smoothing spline algorithm with cross validation. Numer. Algorithms 5(8): 407-417 (1993) - M. T. Bozzini, C. Paracelli:
An algorithm for constrained smoothing functions. Numer. Algorithms 5(7): 341-351 (1993) - L. Brutman:
An application of the generalized alternating polynomials to the numerical solution of Fredholm integral equations. Numer. Algorithms 5(9): 437-442 (1993) - B. P. Butler, A. B. Forbes:
An algorithm for combining data sets having different frames of reference. Numer. Algorithms 5(10): 467-477 (1993) - Raymond H. Chan, Ping Tak Peter Tang:
Constrained minimax approximation and optimal preconditioned for Toeplitz matrices. Numer. Algorithms 5(7): 353-364 (1993) - Patrizia Ciarlini, Franco Pavese:
Application of special reduction procedures to metrological data. Numer. Algorithms 5(10): 479-489 (1993) - Ian D. Coope, Peter R. Graves-Morris:
The rise and fall of the vector epsilon algorithm. Numer. Algorithms 5(6): 275-286 (1993) - M. G. Cox:
Reliable determination of interpolating polynomials. Numer. Algorithms 5(3): 133-154 (1993) - Maurice G. Cox, Peter M. Harris, David A. Humphreys:
An algorithm for the removal of noise and jitter in signals and its application to picosecond electrical measurement. Numer. Algorithms 5(10): 491-508 (1993) - M. G. Cox, J. C. Mason:
Dedication. Numer. Algorithms 5(1): vii-viii (1993) - M. G. Cox, J. C. Mason:
Preface. Numer. Algorithms 5(1): xi-xiii (1993) - Morten Dæhlen, Michael S. Floater:
Iterative polynomial interpolation and data compression. Numer. Algorithms 5(3): 165-177 (1993) - Catterina Dagnino, Vittoria Demichelis, Elisabetta Santi:
An algorithm for numerical integration based on quasi-interpolating splines. Numer. Algorithms 5(9): 443-452 (1993) - Wolfgang Dahmen:
Decomposition of refinable spaces and applications to operator equations. Numer. Algorithms 5(5): 229-245 (1993) - Ruud van Damme:
An algorithm for determining the approximation orders of multivariate periodic spline spaces. Numer. Algorithms 5(1): 71-81 (1993) - Rudolf Drieschner:
Chebyshev approximation to data by geometric elements. Numer. Algorithms 5(10): 509-522 (1993) - G. H. Elliott:
Least squares data fitting using shape preserving piecewise approximations. Numer. Algorithms 5(7): 365-371 (1993) - Diego de Falco, Marco Frontini, L. Gotusso:
A unifying approach to the regularization of Fourier polynomials. Numer. Algorithms 5(8): 419-424 (1993) - A. B. Forbes:
Generalised regression problems in metrology. Numer. Algorithms 5(10): 523-533 (1993) - Emanuele Galligani:
C1 surface interpolation with constraints. Numer. Algorithms 5(11): 549-555 (1993) - Eric Grosse:
Approximation in VLSI simulation. Numer. Algorithms 5(12): 591-601 (1993) - David Handscomb:
Local recovery of a solenoidal vector field by an extension of the thin-plate spline technique. Numer. Algorithms 5(2): 121-129 (1993) - H.-P. Helfrich, D. Zwick:
A trust region method for implicit orthogonal distance regression. Numer. Algorithms 5(10): 535-545 (1993) - Bas J. Hogervorst, Ruud van Damme:
Degenerate polynomial patches of degree 11 for almostGC2 interpolation over triangles. Numer. Algorithms 5(11): 557-568 (1993)
skipping 21 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-26 21:51 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint