Katalog der Deutschen Nationalbibliothek

Neuigkeiten Donnerstag, 11. September 2025: Die Deutsche Nationalbibliothek öffnet wegen eines Beschäftigtentreffens an beiden Standorten erst um 15 Uhr. Die Ausstellungen des Deutschen Buch- und Schriftmuseums sind von 10 bis 18 Uhr geöffnet. Die Ausstellungen des Deutschen Exilarchivs 1933-1945 sind von 9 bis 21:30 Uhr geöffnet. // Thursday, 11 September 2025: The German National Library will not open until 15:00 due to a staff meeting at both locations. The exhibitions of the German Museum of Books and Writing will open from 10:00 to 18:00. The exhibitions of the German Exile Archive 1933–1945 will be open from 9:00 to 21:30.
 
 
 


Ergebnis der Suche nach: tit all "Computational complexity."
im Bestand: Gesamter Bestand

801 - 810 von 889
<< < > >>


Artikel 801 A low computational complexity DOA estimation using sum/difference pattern based on DNN
Enthalten in Multidimensional systems and signal processing Bd. 34, 22.12.2022, Nr. 1, date:3.2023: 205-225
Online Ressource
Artikel 802 A low computational complexity normalized subband adaptive filter algorithm employing signed regressor of input signal
Enthalten in European Association for Speech, Signal and Image Processing: EURASIP journal on advances in signal processing Bd. 2018, 2.4.2018, Nr. 1, date:12.2018: 1-23
Online Ressource
Artikel 803 A low computational complexity V-BLAST/STBC detection mechanism in MIMO system
Enthalten in Human-centric computing and information sciences Bd. 4, 18.6.2014, Nr. 1, date:12.2014: 1-28
Online Ressource
Artikel 804 A method of estimating computational complexity based on input conditions for N-vehicle problem
Enthalten in Acta mathematicae applicatae sinica / English series Bd. 26, 6.11.2009, Nr. 1, date:1.2010: 1-12
Online Ressource
Artikel 805 A new computational decoding complexity measure of convolutional codes
Enthalten in European Association for Speech, Signal and Image Processing: EURASIP journal on advances in signal processing Bd. 2014, 4.12.2014, Nr. 1, date:12.2014: 1-10
Online Ressource
Artikel 806 A Simple Proof for the Upper Bound of the Computational Complexity of Three Monomials in Three Variables
Enthalten in Moskovskij gosudarstvennyj universitet im. M.V. Lomonosova: Moscow University mathematics bulletin Bd. 74, 4.5.2019, Nr. 2, date:3.2019: 43-48
Online Ressource
Artikel 807 A survey on filtered-x least mean square-based active noise control systems with emphasis on reducing computational complexity
Enthalten in European Association for Speech, Signal and Image Processing: EURASIP journal on advances in signal processing Bd. 2023, 9.12.2023, Nr. 1, date:12.2023: 1-30
Online Ressource
Artikel 808 A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
Enthalten in Annals of operations research Bd. 251, 24.11.2015, Nr. 1-2, date:4.2017: 397-427
Online Ressource
Artikel 809 Adaptive temporal compression for reduction of computational complexity in human behavior recognition
Enthalten in Scientific reports Bd. 14, 8.5.2024, Nr. 1, date:12.2024: 1-11
Online Ressource
Artikel 810 An Introduction to the Computational Complexity of Matrix Multiplication
Enthalten in Journal of the operations research society of China Bd. 8, 5.12.2019, Nr. 1, date:3.2020: 29-43
Online Ressource


801 - 810 von 889
<< < > >>


E-Mail-IconAdministration