The Prospects of Optimization Theory Application for Solving Shannon Problem

Συγγραφείς: Zolotarev, V.V., Ovechkin, G.V., Zung, Ch. T.

Πηγή: 2022 24th International Conference on Digital Signal Processing and its Applications (DSPA) Digital Signal Processing and its Applications (DSPA), 2022 24th International Conference on. :1-5 Mar, 2022

Relation: 2022 24th International Conference on Digital Signal Processing and its Applications (DSPA)

Approximation algorithms for solving the heterogeneous rooted tree/path cover problems

Συγγραφείς: Pengxiang Pan, Junran Lichen, Ping Yang, Jianping Li

Πηγή: Journal of Combinatorial Optimization. 49

Θεματικοί όροι: nonuniform speeds, rooted tree/path cover, complexity of algorithms, Mathematical programming, approximation algorithms

Περιγραφή αρχείου: application/xml

A Fast Algorithm to Solve Delay Vandermonde Systems in Phased-Array Digital Receivers

Συγγραφείς: Perera, S.M., Madanayake, A., Ogle, A., Silverio, D., Huang, J.Q.

Πηγή: IEEE Transactions on Aerospace and Electronic Systems IEEE Trans. Aerosp. Electron. Syst. Aerospace and Electronic Systems, IEEE Transactions on. 57(4):2288-2297 Aug, 2021

The Heterogeneous Rooted Tree Cover Problem

Συγγραφείς: Pan, Pengxiang^Aff9, Lichen, Junran^Aff10, Yang, Ping^Aff9, Li, Jianping^Aff9

Συνεισφορές: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Yung, Moti, Editorial Board Member^Aff6, Wu, Weili, editor^Aff7, Tong, Guangmo, editor^Aff8

Πηγή: Computing and Combinatorics : 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part II. 14423:94-105

Complexity and Algorithms for Superposed Data Uploading Problem in Networks With Smart Devices

Συγγραφείς: Li, W., Xu, H., Li, H., Yang, Y., Sharma, P.K., Wang, J., Singh, S.

Πηγή: IEEE Internet of Things Journal IEEE Internet Things J. Internet of Things Journal, IEEE. 7(7):5882-5891 Jul, 2020

Fast Line-Based Intra Prediction for Video Coding

Συγγραφείς: De-Luxan-Hernandez, Santiago, Schwarz, Heiko, Marpe, Detlev, Wiegand, Thomas

Πηγή: 2018 IEEE International Symposium on Multimedia (ISM) ISM Multimedia (ISM), 2018 IEEE International Symposium on. :135-138 Dec, 2018

Relation: 2018 IEEE International Symposium on Multimedia (ISM)

Symbolic Computation with Symmetric Polynomials in Real Algebraic Geometry

Συγγραφείς: Riener, Cordian, Vu, Thi, Xuan

Συνεισφορές: The Arctic University of Norway Tromsø, Norway (UiT), Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Université de Lille

Πηγή: https://hal.science/hal-05199132 ; 2025.

Θεματικοί όροι: invariant theory symmetric polynomials computational complexity efficient algorithms, invariant theory, symmetric polynomials, computational complexity, efficient algorithms, [INFO]Computer Science [cs], [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG]

Διαθεσιμότητα: https://hal.science/hal-05199132
https://hal.science/hal-05199132v1/document
https://hal.science/hal-05199132v1/file/symmetric.pdf

A deterministic algorithm for the discrete logarithm problem in a semigroup

Συγγραφείς: Tinani, Simran, Rosenthal, Joachim

Συνεισφορές: University of Zurich, Tinani, Simran

Πηγή: Journal of Mathematical Cryptology, Vol 16, Iss 1, Pp 141-155 (2022)

Θεματικοί όροι: FOS: Computer and information sciences, discrete logarithm problem, Group Theory (math.GR), 02 engineering and technology, 68q25, Computational Complexity (cs.CC), 01 natural sciences, semigroups, 510 Mathematics, 2604 Applied Mathematics, 1706 Computer Science Applications, complexity of algorithms, QA1-939, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, 0101 mathematics, 94a60, Applied Mathematics, 20m13, Computer Science Applications, 10123 Institute of Mathematics, Computational Mathematics, Computer Science - Computational Complexity, 2605 Computational Mathematics, Mathematics - Group Theory, Mathematics

Περιγραφή αρχείου: Rosenthal_2022_ADeterministicAlgorithm.pdf - application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2101.11500
https://doaj.org/article/dce4f7c6cf5340c5a48cd71e503fbd93
https://www.zora.uzh.ch/id/eprint/219472/
https://doi.org/10.5167/uzh-219472

An Enhanced Density-Based Clustering Algorithm for the Autonomous Indoor Localization

Συγγραφείς: Xu, Yaqian, Kusber, Rico, David, Klaus

Πηγή: 2013 International Conference on MOBILe Wireless MiddleWARE, Operating Systems, and Applications MOBILe Wireless MiddleWARE, Operating Systems and Applications (Mobilware), 2013 International Conference on. :39-44 Nov, 2013

Relation: 2013 International Conference on MOBILe Wireless MiddleWARE, Operating Systems, and Applications (Mobilware)

Proving NP ≠ PSPACE with Dynamic ChaosSpace: A Lean 4 Formalization with Optimized Parameters

Συγγραφείς: Ednyashev, Sanal

Θεματικοί όροι: P ≠ NP, Lean 4, Formal Proof, ChaosSpace, 3SAT, Computational Complexity, Local Algorithms

ChaosSpace: A Lean 4 Formalization of P ≠ NP

Συγγραφείς: Ednyashev, Sanal

Θεματικοί όροι: P ≠ NP, Lean 4, Formal Proof, ChaosSpace, 3SAT, Computational Complexity, Local Algorithms

'Proving P ≠ NP with ChaosSpace: A Lean 4 Formalization with Optimized Parameters

Συγγραφείς: Ednyashev, Sanal

Θεματικοί όροι: P ≠ NP, Lean 4, Formal Proof, ChaosSpace, 3SAT, Computational Complexity, Local Algorithms

Hybrid Parallel Programming in High Performance Computing Cluster

Συγγραφείς: Fedulov, Alexander^Aff19, Fedulova, Anastasiya^Aff20, Fedulov, Yaroslav^Aff19

Συνεισφορές: Kacprzyk, Janusz, Series Editor^{Aff1, Aff18}, Pal, Nikhil R., Advisory Editor^Aff2, Bello Perez, Rafael, Advisory Editor^Aff3, Corchado, Emilio S., Advisory Editor^Aff4, Hagras, Hani, Advisory Editor^Aff5, Kóczy, László T., Advisory Editor^Aff6, Kreinovich, Vladik, Advisory Editor^Aff7, Lin, Chin-Teng, Advisory Editor^Aff8, Lu, Jie, Advisory Editor^Aff9, Melin, Patricia, Advisory Editor^Aff10, Nedjah, Nadia, Advisory Editor^Aff11, Nguyen, Ngoc Thanh, Advisory Editor^Aff12, Wang, Jun, Advisory Editor^Aff13, Zamojski, Wojciech, editor^Aff14, Mazurkiewicz, Jacek, editor^Aff15, Sugier, Jarosław, editor^Aff16, Walkowiak, Tomasz, editor^Aff17

Πηγή: Theory and Engineering of Dependable Computer Systems and Networks : Proceedings of the Sixteenth International Conference on Dependability of Computer Systems DepCoS-RELCOMEX, June 28 – July 2, 2021, Wrocław, Poland. 1389:97-105

Hamiltonian problems in directed graphs with simple row patterns

Συγγραφείς: Rusu, Irena

Πηγή: In Theoretical Computer Science 19 May 2022 916:70-85

Joint Network Optimization and Downlink Beamforming for CoMP Transmissions Using Mixed Integer Conic Programming

Συγγραφείς: Cheng, Y., Pesavento, M., Philipp, A.

Πηγή: IEEE Transactions on Signal Processing IEEE Trans. Signal Process. Signal Processing, IEEE Transactions on. 61(16):3972-3987 Aug, 2013

A variant of the large sieve inequality with explicit constants

Συγγραφείς: Maciej Grzeskowiak

Πηγή: Journal of Mathematical Cryptology, Vol 14, Iss 1, Pp 307-315 (2020)

Θεματικοί όροι: 11n36, 11l40, QA1-939, 0102 computer and information sciences, 68q25, 0101 mathematics, computational complexity of algorithms, 01 natural sciences, lage sieve, Mathematics

Σύνδεσμος πρόσβασης: https://www.degruyter.com/document/doi/10.1515/jmc-2019-0022/pdf
https://doaj.org/article/4007a51c22e146f99af81987d36ee03b
https://dblp.uni-trier.de/db/journals/jmc/jmc14.html#Grzeskowiak20

The Icosian Code and the $E_8$ Lattice: A New $4\,\times\,4$ Space–Time Code With Nonvanishing Determinant

Συγγραφείς: Liu, J., Calderbank, A. R.

Πηγή: IEEE Transactions on Information Theory IEEE Trans. Inform. Theory Information Theory, IEEE Transactions on. 54(8):3782-3789 Aug, 2008

Algebraic Bayesian Networks: Checking Backbone Connectivity

Συγγραφείς: Maksimov, A. G.^{Aff1, IDS1063454121020059_cor1}, Tulupyev, A. L.^{Aff1, Aff2, IDS1063454121020059_cor2}

Πηγή: Vestnik St. Petersburg University, Mathematics. 54(2):187-195

Bellman-Ford is optimal for shortest hop-bounded paths

Συγγραφείς: Kociumaka, Tomasz, Polak, Adam

Συνεισφορές: Tomasz Kociumaka and Adam Polak

Θεματικοί όροι: graph algorithms, FOS: Computer and information sciences, shortest paths, Fine-grained complexity, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, FINE-GRAINED COMPLEXITY, GRAPH ALGORITHMS, LOWER BOUNDS, SHORTEST PATHS, lower bounds, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2211.07325
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.72
https://hdl.handle.net/11565/4061822
https://doi.org/10.4230/lipics.esa.2023.72

Burst-error correction for cyclic codes

Συγγραφείς: Semerenko, Vasyl P.

Πηγή: IEEE EUROCON 2009 EUROCON 2009, EUROCON '09. IEEE. :1650-1655 May, 2009

Relation: IEEE EUROCON 2009 (EUROCON)