Search Results - "computational complexity"

On the complexity of a problem related to Set Cover by Shitov, Yaroslav

Get full text

Inductive definitions in logic versus programs of real-time cellular automata by Grandjean, Etienne, Grente, Théo, Terrier, Véronique

“…Descriptive complexity provides intrinsic, that is,machine-independent, characterizations of the major complexity classes. On the other hand, logic can be…”
Get full text

Linear Precoding of Data and Artificial Noise in Secure Massive MIMO Systems by Jun Zhu, Schober, Robert, Bhargava, Vijay K.

“…In this paper, we consider secure downlink transmission in a multicell massive multiple-input multiple-output (MIMO) system where the numbers of base station…”
Get full text

Complexity, algorithmic, and computational aspects of a dial-a-ride type problem by Baïou, Mourad, Colares, Rafael, Kerivin, Hervé

Get full text

Complexity Lower Bounds from Algorithm Design by Williams, R. Ryan

“…Since the beginning of the theory of computation, researchers have been fascinated by the prospect of proving impossibility results on computing. When and how…”
Get full text

Erratum to "A Novel Approach for Computation of High-Order Axial Modes in a Gyrotron Resonator" [Dec 18 5505-5510] by Vishant, Bera, Anirban, Sinha, Ashok K., Chandrashekhar

“…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…”
Get full text

Mutual visibility in graphs by Di Stefano, Gabriele

“…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…”
Get full text

Low-Complexity Linear Equalization for OTFS Modulation by Surabhi, G. D., Chockalingam, A.

“…In this letter, we propose low-complexity linear equalizers for orthogonal time frequency space (OTFS) modulation that exploit the structure of the effective…”
Get full text

Computation Rate Maximization for Wireless Powered Mobile-Edge Computing With Binary Computation Offloading by Bi, Suzhi, Zhang, Ying Jun

“…Finite battery lifetime and low computing capability of size-constrained wireless devices (WDs) have been longstanding performance limitations of many…”
Get full text

Argumentative Reasoning in ASPIC+ under Incomplete Information by Odekerken, Daphne, Lehtonen, Tuomo, Wallner, Johannes P., Järvisalo, Matti

“…Reasoning under incomplete information is an important research direction in the study of computational argumentation. Most advances in this direction so far…”
Get full text

GMC: Graph-Based Multi-View Clustering by Wang, Hao, Yang, Yan, Liu, Bing

“…Multi-view graph-based clustering aims to provide clustering solutions to multi-view data. However, most existing methods do not give sufficient consideration…”
Get full text

A Robust Version of Heged\H{u}s's Lemma, with Applications by Srinivasan, Srikanth

“…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…”
Get full text

Sampling can be faster than optimization by Ma, Yi-An, Chen, Yuansi, Jin, Chi, Flammarion, Nicolas, Jordan, Michael I

“…Optimization algorithms and Monte Carlo sampling algorithms have provided the computational foundations for the rapid growth in applications of statistical…”
Get more information

Low-complexity Repetitive Double-Vector Model Predictive Control Optimization Strategy for T-type Three-level Converter by Fang, Jian, Li, Ruihua, Wang, Hanqing, Sun, Chenwei, Hu, Bo

“…Conventional multi-vector model predictive control (MV-MPC) for three-level converters suffers from high computational complexity and low optimal…”
Get full text

Infinite Feature Selection: A Graph-based Feature Filtering Approach by Roffo, Giorgio, Melzi, Simone, Castellani, Umberto, Vinciarelli, Alessandro, Cristani, Marco

“…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…”
Get full text

Swarm Robotics: Past, Present, and Future [Point of View] by Dorigo, Marco, Theraulaz, Guy, Trianni, Vito

“…Swarm robotics deals with the design, construction, and deployment of large groups of robots that coordinate and cooperatively solve a problem or perform a…”
Get full text

CBANet: Towards Complexity and Bitrate Adaptive Deep Image Compression using a Single Network by Guo, Jinyang, Xu, Dong, Lu, Guo

“…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…”
Get full text

A Survey on Network Embedding by Cui, Peng, Wang, Xiao, Pei, Jian, Zhu, Wenwu

“…Network embedding assigns nodes in a network to low-dimensional representations and effectively preserves the network structure. Recently, a significant amount…”
Get full text

Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing by Goldreich, Oded, Wigderson, Avi

“…A graph $G$ is called self-ordered (a.k.a asymmetric) if the identity permutation is its only automorphism. Equivalently, there is a unique isomorphism from…”
Get full text

On the computational complexity of the virtual network embedding problem by Amaldi, Edoardo, Coniglio, Stefano, Koster, Arie M.C.A., Tieves, Martin

“…Given a graph representing a substrate (or physical) network with node and edge capacities and a set of virtual networks with node capacity demands and…”
Get full text