主题图谱 / data structures and algorithms

data structures and algorithms

GeneTech 知识引擎共收录 89 篇相关科研实体，横跨 14 个垂直领域。数据来自 OpenAlex、arXiv、Crossref、PubMed、Europe PMC 等公开学术源，全部可溯源到原文。

年度产出趋势

代表性文献（按质量分排序，前 60 条）

• Convergence Analysis for Deep Sparse Coding via Convolutional Neural Networks
  2024 · AI 安全与对齐 · In this work, we explore the intersection of sparse coding theory and deep learning to enhance our understanding of feature extraction capabilities in advanced neural network architectures. We begin by introducing a nove…
• Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering
  2023 · 量子计算 · Quantifying entanglement is an important task by which the resourcefulness of a quantum state can be measured. Here, we develop a quantum algorithm that tests for and quantifies the separability of a general bipartite st…
• Efficient Quantum Algorithms for Nonlinear Stochastic Dynamical Systems
  2023 · 量子材料 · In this paper, we propose efficient quantum algorithms for solving nonlinear stochastic differential equations (SDE) via the associated Fokker-Planck equation (FPE). We discretize the FPE in space and time using two well…
• Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop
  2026 · AI 安全与对齐 · This document presents a series of open questions arising in matrix computations, i.e., the numerical solution of linear algebra problems. It is a result of working groups at the workshop Linear Systems and Eigenvalue Pr…
• Parameterized Algorithms for the Drone Delivery Problem
  2026 · 低空经济 · Timely delivery and optimal routing remain fundamental challenges in the modern logistics industry. Building on prior work that considers single-package delivery across networks using multiple types of collaborative agen…
• Minimizing Total Travel Time for Collaborative Package Delivery with Heterogeneous Drones
  2026 · 低空经济 · Given a fleet of drones with different speeds and a set of package delivery requests, the collaborative delivery problem asks for a schedule for the drones to collaboratively carry out all package deliveries, with the ob…
• Parallel Scan on Ascend AI Accelerators
  2025 · AI 安全与对齐 · We design and implement parallel prefix sum (scan) algorithms using Ascend AI accelerators. Ascend accelerators feature specialized computing units: the cube units for efficient matrix multiplication and the vector units…
• Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks
  2025 · AI 安全与对齐 · We implement and evaluate different methods for the reconfiguration of a connected arrangement of tiles into a desired target shape, using a single active robot that can move along the tile structure. This robot can pick…
• Implementation and Brief Experimental Analysis of the Duan et al. (2025) Algorithm for Single-Source Shortest Paths
  2025 · AI 安全与对齐 · We present an implementation and experimental analysis of the deterministic algorithm proposed by Duan et al. (2025) for the Single-Source Shortest Path (SSSP) problem, which achieves the best-known asymptotic upper boun…
• Polynomial-Time Approximation Schemes via Utility Alignment: Unit-Demand Pricing and More
  2025 · AI 安全与对齐 · This paper derives polynomial-time approximation schemes for several NP-hard stochastic optimization problems from the algorithmic mechanism design and operations research literatures. The problems we consider involve a …
• Hilbert Forest in the SISAP 2025 Indexing Challenge
  2025 · 地外矿物 · We report our participation in the SISAP 2025 Indexing Challenge using a novel indexing technique called the Hilbert forest. The method is based on the fast Hilbert sort algorithm, which efficiently orders high-dimension…
• Computing and Bounding Equilibrium Concentrations in Athermic Chemical Systems
  2025 · 生物计算 · Computing equilibrium concentrations of molecular complexes is generally analytically intractable and requires numerical approaches. In this work we focus on the polymer-monomer level, where indivisible molecules (monome…
• Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks
  2025 · 脑科学 · We implement and evaluate different methods for the reconfiguration of a connected arrangement of tiles into a desired target shape, using a single active robot that can move along the tile structure. This robot can pick…
• Implementation and Brief Experimental Analysis of the Duan et al. (2025) Algorithm for Single-Source Shortest Paths
  2025 · 脑科学 · We present an implementation and experimental analysis of the deterministic algorithm proposed by Duan et al. (2025) for the Single-Source Shortest Path (SSSP) problem, which achieves the best-known asymptotic upper boun…
• Provably faster randomized and quantum algorithms for $k$-means clustering via uniform sampling
  2025 · 量子材料 · The $k$-means algorithm (Lloyd's algorithm) is a widely used method for clustering unlabeled data. A key bottleneck of the $k$-means algorithm is that each iteration requires time linear in the number of data points, whi…
• The En Route Truck-Drone Delivery Problem
  2024 · 低空经济 · We study the truck-drone cooperative delivery problem in a setting where a single truck carrying a drone travels at constant speed on a straight-line trajectory/street. Delivery to clients located in the plane and not on…
• Online Drone Scheduling for Last-mile Delivery
  2024 · 低空经济 · Delivering a parcel from the distribution hub to the customer's doorstep is called the \textit{last-mile delivery} step in delivery logistics. In this paper, we study a hybrid {\it truck-drones} model for the last-mile d…
• Unstructured Adiabatic Quantum Optimization: Optimality with Limitations
  2024 · 量子计算 · In the circuit model of quantum computing, amplitude amplification techniques can be used to find solutions to NP-hard problems defined on $n$-bits in time $\text{poly}(n) 2^{n/2}$. In this work, we investigate whether s…
• Algorithms for Multiple Drone-Delivery Scheduling Problem (MDSP)
  2023 · 低空经济 · The Multiple Drone-Delivery Scheduling Problem (MDSP) is a scheduling problem that optimizes the maximum reward earned by a set of $m$ drones executing a sequence of deliveries on a truck delivery route. The current best…
• Multipartite Entanglement Distribution in Quantum Networks using Subgraph Complementations
  2023 · 量子计算 · Quantum networks are important for quantum communication, enabling tasks such as quantum teleportation, quantum key distribution, quantum sensing, and quantum error correction, often utilizing graph states, a specific cl…
• Basic quantum subroutines: finding multiple marked elements and summing numbers
  2023 · 量子计算 · We show how to find all $k$ marked elements in a list of size $N$ using the optimal number $O(\sqrt{N k})$ of quantum queries and only a polylogarithmic overhead in the gate complexity, in the setting where one has a sma…
• Complexity of Digital Quantum Simulation in the Low-Energy Subspace: Applications and a Lower Bound
  2023 · 量子计算 · Digital quantum simulation has broad applications in approximating unitary evolution of Hamiltonians. In practice, many simulation tasks for quantum systems focus on quantum states in the low-energy subspace instead of t…
• On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks
  2022 · 量子材料 · Classical algorithms are often not effective for solving nonconvex optimization problems where local minima are separated by high barriers. In this paper, we explore possible quantum speedups for nonconvex optimization b…
• Quantum algorithms for escaping from saddle points
  2020 · 量子计算 · We initiate the study of quantum algorithms for escaping from saddle points with provable guarantee. Given a function $f\colon\mathbb{R}^{n}\to\mathbb{R}$, our quantum algorithm outputs an $ε$-approximate second-order st…
• Random Abstract Cell Complexes
  2024 · 合成生物与生物制造 · We define a model for random (abstract) cell complexes (CCs), similiar to the well-known Erdős-Rényi model for graphs and its extensions for simplicial complexes. To build a random cell complex, we first draw from an Erd…
• Stochastic Online Euclidean TSP
  2026 · AI 安全与对齐 · In the Euclidean travelling salesman problem (Euclidean TSP), a salesman must visit $n$ points in Euclidean space, while minimizing the travel distance, according to the Euclidean distance function. In online Euclidean T…
• Approximating Energy-Constrained Drone Delivery Packing Problem for Last-Mile Logistics
  2026 · 低空经济 · Collaboration between drones and trucks in a last-mile delivery system offers numerous benefits and reduces many challenges of the traditional delivery system. Here, we introduce Drone-Delivery Packing Problem, where a s…
• Boundaried Kernelization via Representative Sets
  2025 · AI 安全与对齐 · A kernelization is an efficient algorithm that given an instance of a parameterized problem returns an equivalent instance of size bounded by some function of the input parameter value. It is quite well understood which …
• Quadratic Kernel for Cliques or Trees Vertex Deletion
  2025 · AI 安全与对齐 · We consider \textsc{Cliques or Trees Vertex Deletion}, which is a hybrid of two fundamental parameterized problems: \textsc{Cluster Vertex Deletion} and \textsc{Feedback Vertex Set}. In this problem, we are given an undi…
• A Finer View of the Parameterized Landscape of Labeled Graph Contractions
  2025 · 地外矿物 · We study the \textsc{Labeled Contractibility} problem, where the input consists of two vertex-labeled graphs $G$ and $H$, and the goal is to determine whether $H$ can be obtained from $G$ via a sequence of edge contracti…
• Boundaried Kernelization via Representative Sets
  2025 · 脑科学 · A kernelization is an efficient algorithm that given an instance of a parameterized problem returns an equivalent instance of size bounded by some function of the input parameter value. It is quite well understood which …
• Quadratic Kernel for Cliques or Trees Vertex Deletion
  2025 · 脑科学 · We consider \textsc{Cliques or Trees Vertex Deletion}, which is a hybrid of two fundamental parameterized problems: \textsc{Cluster Vertex Deletion} and \textsc{Feedback Vertex Set}. In this problem, we are given an undi…
• Space-Efficient Quantum Error Reduction without log Factors
  2025 · 量子计算 · Given an algorithm that outputs the correct answer with bounded error, say $1/3$, it is sometimes desirable to reduce this error to some arbitrarily small $\varepsilon$ -- e.g., if one wants to call the algorithm many ti…
• Spectral Gaps with Quantum Counting Queries and Oblivious State Preparation
  2025 · 量子计算 · Approximating the $k$-th spectral gap $Δ_k=|λ_k-λ_{k+1}|$ and the corresponding midpoint $μ_k=\frac{λ_k+λ_{k+1}}{2}$ of an $N\times N$ Hermitian matrix with eigenvalues $λ_1\geqλ_2\geq\ldots\geqλ_N$, is an important spec…
• Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
  2025 · 地外矿物 · We give an overview of the 2025 Computational Geometry Challenge targeting the problem Minimum Non-Obtuse Triangulation: Given a planar straight-line graph G in the plane, defined by a set of points in the plane (represe…
• Secure and secret cooperation in robotic swarms
  2019 · 深海科技 · The importance of swarm robotics systems in both academic research and real-world applications is steadily increasing. However, to reach widespread adoption, new models that ensure the secure cooperation of large groups …
• A framework for cost-constrained genome rearrangement under Double Cut and Join
  2018 · 生命科学 · The study of genome rearrangement has many flavours, but they all are somehow tied to edit distances on variations of a multi-graph called the breakpoint graph. We study a weighted 2-break distance on Eulerian 2-edge-col…
• Defending against Intrusion of Malicious UAVs with Networked UAV Defense Swarms
  2018 · 低空经济 · Nowadays, companies such as Amazon, Alibaba, and even pizza chains are pushing forward to use drones, also called UAVs (Unmanned Aerial Vehicles), for service provision, such as package and food delivery. As governments …
• Genome-on-Diet: Taming Large-Scale Genomic Analyses via Sparsified Genomics
  2022 · 生命科学 · Searching for similar genomic sequences is an essential and fundamental step in biomedical research and an overwhelming majority of genomic analyses. State-of-the-art computational methods performing such comparisons fai…
• Package Delivery Using Drones with Restricted Movement Areas
  2022 · 低空经济 · For the problem of delivering a package from a source node to a destination node in a graph using a set of drones, we study the setting where the movements of each drone are restricted to a certain subgraph of the given …
• Logistics in the Sky: A Two-phase Optimization Approach for the Drone Package Pickup and Delivery System
  2022 · 低空经济 · The application of drones in the last-mile distribution is a research hotspot in recent years. Different from the previous urban distribution mode that depends on trucks, this paper proposes a novel package pick-up and d…
• Quantum Regularized Least Squares
  2022 · 量子计算 · Linear regression is a widely used technique to fit linear models and finds widespread applications across different areas such as machine learning and statistics. In most real-world scenarios, however, linear regression…
• Multivariate trace estimation in constant quantum depth
  2022 · 量子计算 · There is a folkloric belief that a depth-$Θ(m)$ quantum circuit is needed to estimate the trace of the product of $m$ density matrices (i.e., a multivariate trace), a subroutine crucial to applications in condensed matte…
• Online Bipartite Matching with Reusable Resources
  2021 · 地外矿物 · We study the classic online bipartite matching problem with a twist: offline vertices, called resources, are $\textit{reusable}$. In particular, when a resource is matched to an online vertex it is unavailable for a dete…
• Quantum-accelerated constraint programming
  2021 · 量子计算 · Constraint programming (CP) is a paradigm used to model and solve constraint satisfaction and combinatorial optimization problems. In CP, problems are modeled with constraints that describe acceptable solutions and solve…
• Testing symmetry on quantum computers
  2021 · 量子计算 · Symmetry is a unifying concept in physics. In quantum information and beyond, it is known that quantum states possessing symmetry are not useful for certain information-processing tasks. For example, states that commute …
• Quantum routing with fast reversals
  2021 · 量子计算 · We present methods for implementing arbitrary permutations of qubits under interaction constraints. Our protocols make use of previous methods for rapidly reversing the order of qubits along a path. Given nearest-neighbo…
• Finding longer cycles via shortest colourful cycle
  2024 · AI 安全与对齐 · We consider the parameterised $k,e$-Long Cycle problem, in which you are given an $n$-vertex undirected graph $G$, a specified edge $e$ in $G$, and a positive integer $k$, and are asked to decide if the graph $G$ has a s…
• Recent Increments in Incremental View Maintenance
  2024 · 地外矿物 · We overview recent progress on the longstanding problem of incremental view maintenance (IVM), with a focus on the fine-grained complexity and optimality of IVM for classes of conjunctive queries. This theoretical progre…
• Recent Increments in Incremental View Maintenance
  2024 · 生命科学 · We overview recent progress on the longstanding problem of incremental view maintenance (IVM), with a focus on the fine-grained complexity and optimality of IVM for classes of conjunctive queries. This theoretical progre…
• Quantum Realization of the Finite Element Method
  2024 · 量子材料 · This paper presents a quantum algorithm for the solution of prototypical second-order linear elliptic partial differential equations discretized by $d$-linear finite elements on Cartesian grids of a bounded $d$-dimension…
• Implementing any Linear Combination of Unitaries on Intermediate-term Quantum Computers
  2023 · 量子计算 · We develop three new methods to implement any Linear Combination of Unitaries (LCU), a powerful quantum algorithmic tool with diverse applications. While the standard LCU procedure requires several ancilla qubits and sop…
• ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation
  2021 · AI 安全与对齐 · This paper studies the expressive power of artificial neural networks with rectified linear units. In order to study them as a model of real-valued computation, we introduce the concept of Max-Affine Arithmetic Programs …
• An alignment problem
  2024 · AI 安全与对齐 · This work concerns an alignment problem that has applications in many geospatial problems such as resource allocation and building reliable disease maps. Here, we introduce the problem of optimally aligning $k$ collectio…
• Maximum Polygon Packing: The CG:SHOP Challenge 2024
  2024 · 地外矿物 · We give an overview of the 2024 Computational Geometry Challenge targeting the problem \textsc{Maximum Polygon Packing}: Given a convex region $P$ in the plane, and a collection of simple polygons $Q_1, \ldots, Q_n$, eac…
• Improved Quantum Query Complexity on Easier Inputs
  2023 · 量子计算 · Quantum span program algorithms for function evaluation sometimes have reduced query complexity when promised that the input has a certain structure. We design a modified span program algorithm to show these improvements…
• Quantum algorithms for Second-Order Cone Programming and Support Vector Machines
  2019 · 量子计算 · We present a quantum interior-point method (IPM) for second-order cone programming (SOCP) that runs in time $\widetilde{O} \left( n\sqrt{r} \frac{ζκ}{δ^2} \log \left(1/ε\right) \right)$ where $r$ is the rank and $n$ the …
• Quantum-inspired algorithms in practice
  2019 · 量子计算 · We study the practical performance of quantum-inspired algorithms for recommendation systems and linear systems of equations. These algorithms were shown to have an exponential asymptotic speedup compared to previously k…
• Quantum algorithm for estimating volumes of convex bodies
  2019 · 量子计算 · Estimating the volume of a convex body is a central problem in convex geometry and can be viewed as a continuous version of counting. We present a quantum algorithm that estimates the volume of an $n$-dimensional convex …
• Shouji: A Fast and Efficient Pre-Alignment Filter for Sequence Alignment
  2018 · AI 安全与对齐 · Motivation: The ability to generate massive amounts of sequencing data continues to overwhelm the processing capability of existing algorithms and compute infrastructures. In this work, we explore the use of hardware/sof…

以 API 获取该主题全量数据

# 主题词表（含本主题的站点分布与年度分布）
curl http://data.swarmlabs.tools/api/topics.json

# 主题共现知识图谱
curl http://data.swarmlabs.tools/api/graph.json

需要按主题批量拉取、导出 BibTeX 或接入 AI Agent？查看 数据下载与格式 或 MCP 接入。