Results 111 to 120 of about 23,779 (205)
Learning minimal interpretable models (e.g., decision trees, decision sets, and binary decision diagrams) is computationally challenging, yet increasingly important in high-stakes settings.
Zhigao Huang, Shiyan Zheng, Quanfa Li
doaj +1 more source
Constrained and ordered level planarity parameterized by the number of levels
The problem Level Planarity asks for a crossing-free drawing of a graph in the plane such that vertices are placed at prescribed y-coordinates (called levels) and such that every edge is realized as a y-monotone curve.
Václav Blažej +5 more
doaj +1 more source
The Parameterized Complexity of the Survivable Network Design Problem
For the well-known Survivable Network Design Problem (SNDP) we are given an undirected graph $G$ with edge costs, a set $R$ of terminal vertices, and an integer demand $d_{s,t}$ for every terminal pair $s,t\in R$. The task is to compute a subgraph $H$ of
Mukherjee, Anish +2 more
core
Enhanced natural parameterized quantum circuit
The classical-quantum interface for loading classical data into quantum systems is an indispensable component of quantum information processing, and the parameterized quantum circuit (PQC) represents significant methodology in this area.
Yuquan Chen +6 more
doaj +1 more source
Drone-view object detection models operating under low-light conditions face several challenges, such as object scale variations, high image noise, and limited computational resources.
Tianhang Weng, Xiaopeng Niu
doaj +1 more source
On-board Multi-User Detection Algorithm Based on Conditional Neural Process
With the characteristics of all-terrain, all-weather and seamless coverage, satellite communications have become a potentially important part of 6G.An important prerequisite for achieving satellite intelligence is that the satellite have on-board ...
Yilun LIU +3 more
doaj
Quantum Computing Meets Deep Learning: A QCNN Model for Accurate and Efficient Image Classification
In deep learning, Convolutional Neural Networks (CNNs) serve as fundamental models, leveraging the correlational structure of data for tasks such as image classification and processing.
Sunil Prajapat +4 more
doaj +1 more source
Parameterized Complexity of Paired Domination
The Paired Domination problem is one of the well-studied variants of the classical Dominating Set problem. In a graph G on nvertices, a dominating set D (set of vertices such that N[D] = V (G)) is called a paired dominating set of G, if G[D] has perfect matching. In the Paired Domination problem, given a graph G and a positive integer k, the task is to
Andreev, Nikita +5 more
openaire +2 more sources
Parameterized complexity of quantum invariants
We give a general fixed parameter tractable algorithm to compute quantum invariants of links presented by diagrams, whose complexity is singly exponential in the carving-width (or the tree-width) of the diagram. In particular, we get a $O(N^{\frac{3}{2} \mathrm{cw}} \mathrm{poly}(n))$ time algorithm to compute any Reshetikhin-Turaev invariant---derived
openaire +5 more sources
Scalable parameterized quantum circuits classifier
As a generalized quantum machine learning model, parameterized quantum circuits (PQC) have been found to perform poorly in terms of classification accuracy and model scalability for multi-category classification tasks. To address this issue, we propose a
Xiaodong Ding +5 more
doaj +1 more source

