- Sprache
-
Englisch
- Umfang
-
Online-Ressource
- Anmerkungen
-
Saarbrücken, Universität des Saarlandes, Dissertation, 2023
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Schlagwort
-
Algorithmus
Berechnungskomplexität
Effizienter Algorithmus
Approximationsalgorithmus
NP-vollständiges Problem
Datenstruktur
- Urheber
-
Fischer, Nick
- Beteiligte Personen und Organisationen
-
Bringmann, Karl
- Ereignis
-
Veröffentlichung
- (wo)
-
Saarbrücken
- (wer)
-
Saarländische Universitäts- und Landesbibliothek
- (wann)
-
2023
- DOI
-
10.22028/D291-40531
- URN
-
urn:nbn:de:bsz:291--ds-405314
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:47 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Fischer, Nick
- Bringmann, Karl
- Saarländische Universitäts- und Landesbibliothek
Entstanden
- 2023
Ähnliche Objekte (12)
Fast fourier transform and convolution algorithms
Fast Fourier transform and convolution algorithms
Algorithms for discrete Fourier transform and convolution
Partitioned convolution algorithms for real-time auralization
Partitioned convolution algorithms for real-time auralization
Algorithms for discrete Fourier transform and convolution
Deterministic Sparse FFT Algorithms
Exact and heuristic algorithms for network alignment using graph edit distance models
Solvability exploration of segmentation problem with linear convolution algorithms
Switched Spatial Impulse Response Convolution as an Ambisonic Distance-Panning Function
Compressed Sensing and Sparse Reconstruction Algorithms
Faster Algorithms for Sparse Fourier Transform
Fast fourier transform and convolution algorithms
Fast Fourier transform and convolution algorithms
Algorithms for discrete Fourier transform and convolution
Partitioned convolution algorithms for real-time auralization
Partitioned convolution algorithms for real-time auralization
Algorithms for discrete Fourier transform and convolution
Deterministic Sparse FFT Algorithms
Exact and heuristic algorithms for network alignment using graph edit distance models
Solvability exploration of segmentation problem with linear convolution algorithms
Switched Spatial Impulse Response Convolution as an Ambisonic Distance-Panning Function
Compressed Sensing and Sparse Reconstruction Algorithms
Faster Algorithms for Sparse Fourier Transform
Fast fourier transform and convolution algorithms
Fast Fourier transform and convolution algorithms
Algorithms for discrete Fourier transform and convolution
Partitioned convolution algorithms for real-time auralization
Partitioned convolution algorithms for real-time auralization
Algorithms for discrete Fourier transform and convolution
Deterministic Sparse FFT Algorithms
Exact and heuristic algorithms for network alignment using graph edit distance models
Solvability exploration of segmentation problem with linear convolution algorithms
Switched Spatial Impulse Response Convolution as an Ambisonic Distance-Panning Function
Compressed Sensing and Sparse Reconstruction Algorithms