Suchergebnisse - "complexity algorithms"
-
1
Autoren: et al.
Quelle: Algorithms, Vol 18, Iss 7, p 444 (2025)
Schlagwörter: computer virus model, commensurate order, incommensurate order, stability, chaos, complexity algorithms, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95
Dateibeschreibung: electronic resource
-
2
Autoren: et al.
Quelle: IEEE Transactions on Systems, Man, and Cybernetics: Systems. 53:1384-1396
Schlagwörter: Signal Processing (eess.SP), FOS: Computer and information sciences, Computer Science - Machine Learning, Sound (cs.SD), Systems and Control (eess.SY), 02 engineering and technology, Electrical Engineering and Systems Science - Systems and Control, Computer Science - Sound, Machine Learning (cs.LG), efficient adaptive filtering, frequency-domain adaptive filters (FDAFs), functional links, low-complexity algorithms, nonlinear adaptive filters, Audio and Speech Processing (eess.AS), FOS: Electrical engineering, electronic engineering, information engineering, 0202 electrical engineering, electronic engineering, information engineering, Electrical Engineering and Systems Science - Signal Processing, Electrical Engineering and Systems Science - Audio and Speech Processing
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/abs/2104.09641
-
3
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Lecture Notes in Computer Science ISBN: 9781071639887
Schlagwörter: RNA-protein interaction, Parameterized complexity algorithms, Fragment-based docking, RNA design, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]
Dateibeschreibung: application/pdf
-
4
Autoren:
Schlagwörter: balancing, Codes, Constrained codes, DNA, DNA data storage, Encoding, error-detection, homopolymer run, LOCO codes, low-complexity algorithms, Memory, reconfigurable coding, Signal processing algorithms, Symbols, Table lookup
Dateibeschreibung: application/pdf
Relation: 85193243070; https://hdl.handle.net/11511/110029
-
5
Autoren: et al.
Quelle: Algorithms, Vol 17, Iss 8, p 338 (2024)
Schlagwörter: approximate discrete Fourier transform, wideband spectrum perception, wideband multibeam RF digital beamforming, low-complexity algorithms, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95
Relation: https://www.mdpi.com/1999-4893/17/8/338; https://doaj.org/toc/1999-4893; https://doaj.org/article/23e5cd093ddc4993ac218b33996ad2d7
-
6
Autoren: et al.
Weitere Verfasser: et al.
Quelle: IEEE Transactions on Communications. 68:4104-4116
Schlagwörter: ensemble average performance, full diversity multidimensional codebooks, combinatorial approach, 05 social sciences, 02 engineering and technology, transmission techniques, low-complexity algorithms, fixed grid, 0508 media and communications, signal constellation, full diversity multidimensional codebook design, 0202 electrical engineering, electronic engineering, information engineering, error event analysis, fading channels, signal space diversity, Gaussian-shaped grids, permutation sets, precoding, SSD, [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
-
7
Autoren:
Weitere Verfasser:
Quelle: IEEE Access, Vol 8, Pp 212258-212279 (2020)
Schlagwörter: low complexity algorithms, uplink synchronization, 0508 media and communications, multi-user detection, 05 social sciences, 0202 electrical engineering, electronic engineering, information engineering, LTE random access, code design, Electrical engineering. Electronics. Nuclear engineering, 02 engineering and technology, sinusoidal codes, TK1-9971
-
8
Autoren: et al.
Weitere Verfasser: et al.
Quelle: IEEE Journal on Selected Areas in Communications
Schlagwörter: Engineering, electrical and electronic, Telecommunications, FOS: Computer and information sciences, Low-complexity algorithms, Computer Science - Information Theory, Information Theory (cs.IT), Sphere decoder (SD), Multiple-input multiple-output (MIMO) systems, 02 engineering and technology, Computational Complexity (cs.CC), electrical and electronic, Spatial modulation (SM), Maximum likelihood (ML) decoder, Complexity analysis, Computer Science - Computational Complexity, Engineering, 0203 mechanical engineering, 0202 electrical engineering, electronic engineering, information engineering
Dateibeschreibung: pdf
Zugangs-URL: http://arxiv.org/pdf/1905.09401
http://arxiv.org/abs/1905.09401
http://export.arxiv.org/pdf/1905.09401
https://arxiv.org/pdf/1905.09401.pdf
https://arxiv.org/abs/1905.09401
http://ui.adsabs.harvard.edu/abs/2019arXiv190509401A/abstract
https://ieeexplore.ieee.org/document/8765407/
https://doi.org/10.1109/JSAC.2019.2929454
https://dl.acm.org/doi/10.1109/JSAC.2019.2929454
https://dblp.uni-trier.de/db/journals/jsac/jsac37.html#Al-NahhalBDI19
http://cdm21054.contentdm.oclc.org/cdm/ref/collection/IR/id/8581 -
9
Autoren:
Weitere Verfasser:
Schlagwörter: Parameterized Complexity Algorithms Graph Algorithms Strong Triadic Closure Bayesian Networks, Parametrisierte Komplexität, Algorithmik
Time: 510
Dateibeschreibung: application/pdf
Relation: diss/z2022/0114; https://doi.org/10.17192/z2022.0114
-
10
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Lecture Notes in Computer Science ISBN: 9783030720155
Tools and Algorithms for the Construction and Analysis of Systems
Schmid, S, Schnepf, N & Srba, J 2021, Resilient Capacity-Aware Routing. in J F Groote & K Guldstrand Larsen (eds), Tools and Algorithms for the Construction and Analysis of Systems : 27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings, Part I. vol. 1, Springer, Lecture Notes in Computer Science, vol. 12651, pp. 411-429, International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'21), 27/03/2021. https://doi.org/10.1007/978-3-030-72016-2_22
Schmid, S, Schnepf, N & Srba, J 2021, Resilient Capacity-Aware Routing . in J F Groote & K Guldstrand Larsen (eds), Tools and Algorithms for the Construction and Analysis of Systems : 27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings, Part I . vol. 1, Springer, Lecture Notes in Computer Science, vol. 12651, pp. 411-429, International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'21), 27/03/2021 . https://doi.org/10.1007/978-3-030-72016-2_22Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, computer networks, routing, complexity, algorithms, 102025 Distributed systems, 102025 Verteilte Systeme, 01 natural sciences, Article
Dateibeschreibung: application/pdf
Zugangs-URL: https://link.springer.com/content/pdf/10.1007%2F978-3-030-72016-2_22.pdf
https://ucrisportal.univie.ac.at/de/publications/6b429cf4-19c0-4753-a976-3d40ae310999
https://link.springer.com/chapter/10.1007%2F978-3-030-72016-2_22
https://link.springer.com/content/pdf/10.1007%2F978-3-030-72016-2_22.pdf
https://europepmc.org/article/PMC/PMC7979162
https://rd.springer.com/chapter/10.1007/978-3-030-72016-2_22
https://dblp.uni-trier.de/db/conf/tacas/tacas2021-1.html#0001SS21 -
11
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 2017 International Conference on Mathematics and Information Technology (ICMIT). :279-285
Schlagwörter: energy conservation, Transform, [MATH] Mathematics [math], 02 engineering and technology, pruning approach, 7. Clean energy, image compression, [SPI.TRON] Engineering Sciences [physics]/Electronics, low-complexity algorithms, WVSNs, pruned 8-point DCT, Discrete, 0202 electrical engineering, electronic engineering, information engineering, Cosine, approximate DCT
-
12
Autoren: et al.
Weitere Verfasser: et al.
Quelle: https://hal.science/hal-03816423 ; 2022.
Schlagwörter: Fragment-based docking, RNA design, RNA-protein interaction, Parameterized complexity algorithms, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM]
Relation: hal-03816423; https://hal.science/hal-03816423; https://hal.science/hal-03816423/document; https://hal.science/hal-03816423/file/RECOMB-2023-FPTFragDock.pdf
-
13
Autoren:
Weitere Verfasser:
Schlagwörter: LTE random access, uplink synchronization, sinusoidal codes, code design, low complexity algorithms, multi-user detection
Relation: IEEE Access Vol. 8, p. 212258-212279; http://hdl.handle.net/1959.13/1425770; uon:38310
Verfügbarkeit: http://hdl.handle.net/1959.13/1425770
-
14
Autoren:
Weitere Verfasser:
Schlagwörter: Beta-Sécrétase 1, Alzheimer's disease, Algorithmes de complexité paramétrés, Fragment-Based design, Aptamers, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], Beta-Secretase 1, Parameterized complexity algorithms, Maladie d'Alzheimer, [CHIM.CHEM] Chemical Sciences/Cheminformatics, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Approche par Fragments, Aptamères, Color-Coding
Dateibeschreibung: application/pdf
Zugangs-URL: https://theses.hal.science/tel-04538513v1
-
15
Autoren:
Weitere Verfasser:
Quelle: Proceedings-IEEE International Conference on Ultra-Wideband
Schlagwörter: Ultra-wideband signal, Range finders, Range estimation, Lower bounds, 02 engineering and technology, High-time resolution, Complexity algorithms, 3. Good health, Broadband networks, Wireless positioning, Ultra-wideband (UWB), Cramér-Rao lower bound, Ultra wide band systems, Statistical performance, 0202 electrical engineering, electronic engineering, information engineering, Ultra-wideband, Algorithms
Dateibeschreibung: application/pdf
-
16
Autoren: L.A.Pomortsev
Quelle: Global Journal of Computer Science and Technology; Vol. 19 No. G4 (2019): GJCST-G Interdisciplinary: Volume 19 Issue G4; 1-15 ; 0975-4172 ; 0975-4350
Schlagwörter: axiom, postulate, complexity algorithms, alphabet
Dateibeschreibung: application/pdf; application/zip; text/xml; text/html; application/epub+zip; text/plain; text/x-tex
Relation: https://computerresearch.org/index.php/computer/article/view/1888/1872; https://computerresearch.org/index.php/computer/article/view/1888/1-Systems-Verbalization_TEI_xml_zip; https://computerresearch.org/index.php/computer/article/view/1888/1-Systems-Verbalization_JATS_NLM_xml; https://computerresearch.org/index.php/computer/article/view/1888/1-Systems-Verbalization_html; https://computerresearch.org/index.php/computer/article/view/1888/1-Systems-Verbalization_dbk_xml_zip; https://computerresearch.org/index.php/computer/article/view/1888/1-Systems-Verbalization_LaTeX_pdf; https://computerresearch.org/index.php/computer/article/view/1888/1-Systems-Verbalization_epub; https://computerresearch.org/index.php/computer/article/view/1888/1-Systems-Verbalization_md; https://computerresearch.org/index.php/computer/article/view/1888/1-Systems-Verbalization_fo; https://computerresearch.org/index.php/computer/article/view/1888/1-Systems-Verbalization_bib; https://computerresearch.org/index.php/computer/article/view/1888/1-Systems-Verbalization_tex; https://computerresearch.org/index.php/computer/article/view/1888
-
17
Autoren: et al.
Weitere Verfasser: et al.
Quelle: https://theses.hal.science/tel-04538513 ; Complexité [cs.CC]. Université Paris-Saclay, 2024. Français. ⟨NNT : 2024UPASL002⟩.
Schlagwörter: Beta-Secretase 1, Alzheimer's disease, Color-Coding, Parameterized complexity algorithms, Fragment-Based design, Aptamers, Beta-Sécrétase 1, Maladie d'Alzheimer, Algorithmes de complexité paramétrés, Approche par Fragments, Aptamères, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [CHIM.CHEM]Chemical Sciences/Cheminformatics
Relation: NNT: 2024UPASL002
-
18
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Aptamères, Approche par Fragments, Algorithmes de complexité paramétrés, Color-Coding, Maladie d'Alzheimer, Beta-Sécrétase 1, Aptamers, Fragment-Based design, Parameterized complexity algorithms, Alzheimer's disease, Beta-Secretase 1
Verfügbarkeit: http://www.theses.fr/2024UPASL002/document
-
19
Autoren:
Quelle: 2012 IEEE Wireless Communications and Networking Conference (WCNC). :475-479
Schlagwörter: Cooperative OFDMA system, User-user distance, User-receiver distance, Power allocation, 02 engineering and technology, Receivers, Maximum weighted matching problem, 0203 mechanical engineering, Undirected graph, Polynomial time, 0202 electrical engineering, electronic engineering, information engineering, Heuristic algorithms, Wireless networks, Jointly optimal power allocation, Diversity, Signal to noise ratio, Resource management, Optimal matching algorithm, Systems, Near-optimal partner selection, Complexity algorithms, Frequency division multiple access, Computational complexity, Graph theory, Subcarrier, Fading, Partner selection policies, Uplink
Dateibeschreibung: application/pdf
Zugangs-URL: http://ieeexplore.ieee.org/document/6214413/
https://ieeexplore.ieee.org/document/6214413/
https://acikerisim.isikun.edu.tr/xmlui/handle/11729/612
https://dblp.uni-trier.de/db/conf/wcnc/wcnc2012.html#BaksiKB12
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000006214413
http://www2.isikun.edu.tr/personel/onurkaya/papers/wcnc2012final.pdf
https://hdl.handle.net/11729/612 -
20
Autoren:
Quelle: Mathematical Social Sciences. 76:53-63
Schlagwörter: 0211 other engineering and technologies, voting games, graphs, connected components, complexity, algorithms, power index, Banzhaf, Shapley–Shubik, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences
Dateibeschreibung: application/pdf
Zugangs-URL: https://econpapers.repec.org/RePEc:eee:matsoc:v:76:y:2015:i:c:p:53-63
https://dblp.uni-trier.de/db/journals/mss/mss76.html#BenatiRT15
https://ideas.repec.org/a/eee/matsoc/v76y2015icp53-63.html
https://www.sciencedirect.com/science/article/pii/S016548961500027X
https://doi.org/10.1016/j.mathsocsci.2015.04.001
https://iris.univr.it/handle/11562/933298
https://hdl.handle.net/11572/110680
Full Text Finder
Nájsť tento článok vo Web of Science