Full Text Available
Access Full Text at Repository
Search Results - "Computer"
-
VUDA: Breaking CUDA-Vulkan Isolation for Spatial Sharing of Compute and Graphics on the Same GPU
Published in ArXiv cs.DC Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
Online Article RSS Article -
Static Type Checking for Database Access Code
Published in ArXiv cs.DB Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Unfair by design: eBPF-based scheduling of mixed database workloads
Published in ArXiv cs.DB Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
QuIVer: Rethinking ANN Graph Topology via Training-Free Binary Quantization
Published in ArXiv cs.DB Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
LAPRAS : Learning-Augmented PRivate Answering for linear query Streams
Published in ArXiv cs.DB Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Needle-in-RAG: Prompt-Conditioned Character-Level Traceback of Poisoned Spans in Retrieved Evidence
Published in ArXiv cs.DB Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Actionable Understanding: Action Units for Bridging the Knowledge-Action Gap in Post-FAIR Knowledge Infrastructures
Published in ArXiv cs.DB Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Don't Be a Pot Stirrer! Authorized Vector Data Retrieval via Access-Aware Indexing
Published in ArXiv cs.DB Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Write-Read Decoupling in Modern Large-Scale Search Engines: Architectures, Techniques, and Emerging Approaches
Published in ArXiv cs.DB Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
An $widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Potential Hessian Ascent III: Sampling the Sherrington--Kirkpatrick Model at Beta < 1/2
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Exact and Approximate Algorithms for Polytree Learning
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Provable Accuracy Collapse in Embedding-Based Representations under Dimensionality Mismatch
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Visibility Queries in Simple Polygons
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text