Suchergebnisse - "COMPUTATIONAL complexity"
-
1
On the complexity of a problem related to Set Cover
ISSN: 0304-3975Veröffentlicht: 01.11.2025Veröffentlicht in Theoretical computer science (01.11.2025)Volltext
Journal Article -
2
Inductive definitions in logic versus programs of real-time cellular automata
ISSN: 0304-3975, 1879-2294Veröffentlicht: Elsevier 01.03.2024Veröffentlicht in Theoretical computer science (01.03.2024)“… Descriptive complexity provides intrinsic, that is,machine-independent, characterizations of the major complexity classes. On the other hand, logic can be …”
Volltext
Journal Article -
3
Linear Precoding of Data and Artificial Noise in Secure Massive MIMO Systems
ISSN: 1536-1276, 1558-2248Veröffentlicht: New York IEEE 01.03.2016Veröffentlicht in IEEE transactions on wireless communications (01.03.2016)“… In this paper, we consider secure downlink transmission in a multicell massive multiple-input multiple-output (MIMO) system where the numbers of base station …”
Volltext
Journal Article -
4
Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
ISSN: 0377-2217, 1872-6860Veröffentlicht: Elsevier 01.10.2023Veröffentlicht in European journal of operational research (01.10.2023)Volltext
Journal Article -
5
Complexity Lower Bounds from Algorithm Design
Veröffentlicht: IEEE 29.06.2021Veröffentlicht in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… Since the beginning of the theory of computation, researchers have been fascinated by the prospect of proving impossibility results on computing. When and how …”
Volltext
Tagungsbericht -
6
Erratum to "A Novel Approach for Computation of High-Order Axial Modes in a Gyrotron Resonator" [Dec 18 5505-5510]
ISSN: 0018-9383, 1557-9646Veröffentlicht: New York IEEE 01.03.2019Veröffentlicht in IEEE transactions on electron devices (01.03.2019)“… The authors would like to make a correction to the affiliation section of <xref ref-type="bibr" rid="ref1">[1] on page 1, because one of the affiliations in …”
Volltext
Journal Article -
7
Hypergraph theory : an introduction
ISBN: 9783319000794, 3319000799, 3319033700, 9783319033709ISSN: 2192-4732, 2192-4740Veröffentlicht: Cham Springer 2013“… This book presents hypergraph theory and covers traditional elements of the theory as well as original concepts such as entropy of hypergraph, similarities and …”
Volltext
E-Book Buch -
8
Mutual visibility in graphs
ISSN: 0096-3003Veröffentlicht: Elsevier Inc 15.04.2022Veröffentlicht in Applied mathematics and computation (15.04.2022)“… Let G=(V,E) be a graph and P⊆V a set of points. Two points are mutually visible if there is a shortest path between them without further points. P is a …”
Volltext
Journal Article -
9
Low-Complexity Linear Equalization for OTFS Modulation
ISSN: 1089-7798, 1558-2558Veröffentlicht: New York IEEE 01.02.2020Veröffentlicht in IEEE communications letters (01.02.2020)“… In this letter, we propose low-complexity linear equalizers for orthogonal time frequency space (OTFS) modulation that exploit the structure of the effective …”
Volltext
Journal Article -
10
Computation Rate Maximization for Wireless Powered Mobile-Edge Computing With Binary Computation Offloading
ISSN: 1536-1276Veröffentlicht: IEEE 01.06.2018Veröffentlicht in IEEE transactions on wireless communications (01.06.2018)“… Finite battery lifetime and low computing capability of size-constrained wireless devices (WDs) have been longstanding performance limitations of many …”
Volltext
Journal Article -
11
Argumentative Reasoning in ASPIC+ under Incomplete Information
ISSN: 1076-9757, 1076-9757Veröffentlicht: 07.08.2025Veröffentlicht in The Journal of artificial intelligence research (07.08.2025)“… Reasoning under incomplete information is an important research direction in the study of computational argumentation. Most advances in this direction so far …”
Volltext
Journal Article -
12
Computational Science – ICCS 2022: 22nd International Conference, London, UK, June 21–23, 2022, Proceedings, Part III
ISBN: 9783031087578, 3031087577, 9783031087561, 3031087569ISSN: 0302-9743, 1611-3349Veröffentlicht: Cham Springer Nature 2022“… The four-volume set LNCS 13350, 13351, 13352, and 13353 constitutes the proceedings of the 22ndt International Conference on Computational Science, ICCS 2022, …”
Volltext
E-Book Tagungsbericht -
13
A Robust Version of Heged\H{u}s's Lemma, with Applications
ISSN: 2751-4838, 2751-4838Veröffentlicht: TheoretiCS Foundation e.V 01.03.2023Veröffentlicht in TheoretiCS (01.03.2023)“… Heged\H{u}s's lemma is the following combinatorial statement regarding polynomials over finite fields. Over a field $\mathbb{F}$ of characteristic $p > 0$ and …”
Volltext
Journal Article -
14
GMC: Graph-Based Multi-View Clustering
ISSN: 1041-4347, 1558-2191Veröffentlicht: New York IEEE 01.06.2020Veröffentlicht in IEEE transactions on knowledge and data engineering (01.06.2020)“… Multi-view graph-based clustering aims to provide clustering solutions to multi-view data. However, most existing methods do not give sufficient consideration …”
Volltext
Journal Article -
15
Optimal Trace Distance and Fidelity Estimations for Pure Quantum States
ISSN: 0018-9448, 1557-9654Veröffentlicht: Institute of Electrical and Electronics Engineers (IEEE) 01.12.2024Veröffentlicht in IEEE Transactions on Information Theory (01.12.2024)Volltext
Journal Article -
16
Sampling can be faster than optimization
ISSN: 1091-6490, 1091-6490Veröffentlicht: United States 15.10.2019Veröffentlicht in Proceedings of the National Academy of Sciences - PNAS (15.10.2019)“… Optimization algorithms and Monte Carlo sampling algorithms have provided the computational foundations for the rapid growth in applications of statistical …”
Weitere Angaben
Journal Article -
17
Low-complexity Repetitive Double-Vector Model Predictive Control Optimization Strategy for T-type Three-level Converter
ISSN: 0885-8993, 1941-0107Veröffentlicht: IEEE 2025Veröffentlicht in IEEE transactions on power electronics (2025)“… Conventional multi-vector model predictive control (MV-MPC) for three-level converters suffers from high computational complexity and low optimal …”
Volltext
Journal Article -
18
Infinite Feature Selection: A Graph-based Feature Filtering Approach
ISSN: 0162-8828, 1939-3539, 2160-9292, 1939-3539Veröffentlicht: New York IEEE 01.12.2021Veröffentlicht in IEEE transactions on pattern analysis and machine intelligence (01.12.2021)“… We propose a filtering feature selection framework that considers subsets of features as paths in a graph, where a node is a feature and an edge indicates …”
Volltext
Journal Article -
19
Swarm Robotics: Past, Present, and Future [Point of View]
ISSN: 0018-9219, 1558-2256Veröffentlicht: New York IEEE 01.07.2021Veröffentlicht in Proceedings of the IEEE (01.07.2021)“… Swarm robotics deals with the design, construction, and deployment of large groups of robots that coordinate and cooperatively solve a problem or perform a …”
Volltext
Journal Article -
20
CBANet: Towards Complexity and Bitrate Adaptive Deep Image Compression using a Single Network
ISSN: 1057-7149Veröffentlicht: IEEE 06.03.2023Veröffentlicht in IEEE transactions on image processing (06.03.2023)“… In this work, we propose a new deep image compression framework that aims to learn one single network to support variable bitrate coding under various …”
Volltext
Journal Article

