HT-HEDL: High-Throughput Hypothesis Evaluation in Description Logic
Fuente:
arXiv
Guardado en:
| Autor principal: | Algahtani, Eyad |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
SPILDL: A Scalable and Parallel Inductive Learner in Description Logic
por: Algahtani, Eyad
Publicado: (2024)
por: Algahtani, Eyad
Publicado: (2024)
Decomposable Submodular Maximization in Federated Setting
por: Rafiey, Akbar
Publicado: (2024)
por: Rafiey, Akbar
Publicado: (2024)
Gradient-less Federated Gradient Boosting Trees with Learnable Learning Rates
por: Ma, Chenyang, et al.
Publicado: (2023)
por: Ma, Chenyang, et al.
Publicado: (2023)
MACKO: Sparse Matrix-Vector Multiplication for Low Sparsity
por: Macko, Vladimír, et al.
Publicado: (2025)
por: Macko, Vladimír, et al.
Publicado: (2025)
Decoupling Generation and Evaluation for Parallel Greedy Best-First Search(extended version)
por: Shimoda, Takumi, et al.
Publicado: (2024)
por: Shimoda, Takumi, et al.
Publicado: (2024)
Theoretical Lower Bounds for the Oven Scheduling Problem
por: Da Ros, Francesca, et al.
Publicado: (2024)
por: Da Ros, Francesca, et al.
Publicado: (2024)
Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints
por: Lechowicz, Adam, et al.
Publicado: (2024)
por: Lechowicz, Adam, et al.
Publicado: (2024)
GreedyML: A Parallel Algorithm for Maximizing Constrained Submodular Functions
por: Gopal, Shivaram, et al.
Publicado: (2024)
por: Gopal, Shivaram, et al.
Publicado: (2024)
PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search
por: Yu, Shangdi, et al.
Publicado: (2023)
por: Yu, Shangdi, et al.
Publicado: (2023)
Distributed clustering in partially overlapping feature spaces
por: Maritan, Alessio, et al.
Publicado: (2025)
por: Maritan, Alessio, et al.
Publicado: (2025)
Simple Opinion Dynamics for No-Regret Learning
por: Lazarsfeld, John, et al.
Publicado: (2023)
por: Lazarsfeld, John, et al.
Publicado: (2023)
Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models
por: Chen, Yixin, et al.
Publicado: (2022)
por: Chen, Yixin, et al.
Publicado: (2022)
Fast Broadcast in Highly Connected Networks
por: Chandra, Shashwat, et al.
Publicado: (2024)
por: Chandra, Shashwat, et al.
Publicado: (2024)
Evaluation of Dynamic Vector Bin Packing for Virtual Machine Placement
por: Lee, Zong Yu, et al.
Publicado: (2026)
por: Lee, Zong Yu, et al.
Publicado: (2026)
Fully Scalable MPC Algorithms for Clustering in High Dimension
por: Czumaj, Artur, et al.
Publicado: (2023)
por: Czumaj, Artur, et al.
Publicado: (2023)
Parallel Sampling via Autospeculation
por: Anari, Nima, et al.
Publicado: (2025)
por: Anari, Nima, et al.
Publicado: (2025)
Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
por: Baumecker, Malte, et al.
Publicado: (2025)
por: Baumecker, Malte, et al.
Publicado: (2025)
Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion
por: Lenzen, Christoph, et al.
Publicado: (2024)
por: Lenzen, Christoph, et al.
Publicado: (2024)
WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
por: McCoy, Hunter, et al.
Publicado: (2025)
por: McCoy, Hunter, et al.
Publicado: (2025)
Improved All-Pairs Approximate Shortest Paths in Congested Clique
por: Bui, Hong Duc, et al.
Publicado: (2024)
por: Bui, Hong Duc, et al.
Publicado: (2024)
On Distributed Computation of the Minimum Triangle Edge Transversal
por: Censor-Hillel, Keren, et al.
Publicado: (2024)
por: Censor-Hillel, Keren, et al.
Publicado: (2024)
Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
por: Yang, Mingqi
Publicado: (2024)
por: Yang, Mingqi
Publicado: (2024)
Parallel Cluster-BFS and Applications to Shortest Paths
por: Wang, Letong, et al.
Publicado: (2024)
por: Wang, Letong, et al.
Publicado: (2024)
Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
por: Hsieh, Chou-Ying, et al.
Publicado: (2024)
por: Hsieh, Chou-Ying, et al.
Publicado: (2024)
Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
por: Liu, Quanquan C., et al.
Publicado: (2024)
por: Liu, Quanquan C., et al.
Publicado: (2024)
Revising Apetrei's bounding volume hierarchy construction algorithm to allow stackless traversal
por: Prokopenko, Andrey, et al.
Publicado: (2024)
por: Prokopenko, Andrey, et al.
Publicado: (2024)
Hash & Adjust: Competitive Demand-Aware Consistent Hashing
por: Pourdamghani, Arash, et al.
Publicado: (2024)
por: Pourdamghani, Arash, et al.
Publicado: (2024)
Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
por: Ghaffari, Mohsen, et al.
Publicado: (2024)
por: Ghaffari, Mohsen, et al.
Publicado: (2024)
Parallel Integer Sort: Theory and Practice
por: Dong, Xiaojun, et al.
Publicado: (2024)
por: Dong, Xiaojun, et al.
Publicado: (2024)
Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs
por: Akker, Erik van den, et al.
Publicado: (2024)
por: Akker, Erik van den, et al.
Publicado: (2024)
Low-Distortion Clustering in Bounded Growth Graphs
por: Chang, Yi-Jun, et al.
Publicado: (2024)
por: Chang, Yi-Jun, et al.
Publicado: (2024)
Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions
por: Polyanskii, Nikita, et al.
Publicado: (2024)
por: Polyanskii, Nikita, et al.
Publicado: (2024)
Cuckoo Heavy Keeper and the balancing act of maintaining heavy hitters in stream processing
por: Ngo, Vinh Quang, et al.
Publicado: (2024)
por: Ngo, Vinh Quang, et al.
Publicado: (2024)
Distributed Maximum Flow in Planar Graphs
por: Abd-Elhaleem, Yaseen, et al.
Publicado: (2024)
por: Abd-Elhaleem, Yaseen, et al.
Publicado: (2024)
Dynamic Maximal Matching in Clique Networks
por: Li, Minming, et al.
Publicado: (2024)
por: Li, Minming, et al.
Publicado: (2024)
Massively Parallel Ruling Set Made Deterministic
por: Giliberti, Jeff, et al.
Publicado: (2024)
por: Giliberti, Jeff, et al.
Publicado: (2024)
The Blocklace: A Byzantine-repelling and Universal Conflict-free Replicated Data Type
por: Almeida, Paulo Sérgio, et al.
Publicado: (2024)
por: Almeida, Paulo Sérgio, et al.
Publicado: (2024)
Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning
por: Sanders, Peter, et al.
Publicado: (2024)
por: Sanders, Peter, et al.
Publicado: (2024)
Efficient Enumeration of Large Maximal k-Plexes
por: Cheng, Qihao, et al.
Publicado: (2024)
por: Cheng, Qihao, et al.
Publicado: (2024)
Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
por: Gil, Yuval
Publicado: (2024)
por: Gil, Yuval
Publicado: (2024)
Ejemplares similares
-
SPILDL: A Scalable and Parallel Inductive Learner in Description Logic
por: Algahtani, Eyad
Publicado: (2024) -
Decomposable Submodular Maximization in Federated Setting
por: Rafiey, Akbar
Publicado: (2024) -
Gradient-less Federated Gradient Boosting Trees with Learnable Learning Rates
por: Ma, Chenyang, et al.
Publicado: (2023) -
MACKO: Sparse Matrix-Vector Multiplication for Low Sparsity
por: Macko, Vladimír, et al.
Publicado: (2025) -
Decoupling Generation and Evaluation for Parallel Greedy Best-First Search(extended version)
por: Shimoda, Takumi, et al.
Publicado: (2024)