Expertini Research Research

Browse Research Papers

3,494+ open-access research outputs.

โœ• Clear
๐Ÿ” u kang ๐Ÿ“‚ Computer Science
Showing 3494 results for "u kang" in Computer Science
Computer Science Preprint PDF DOI

FlashRT: Towards Computationally and Memory Efficient Red-Teaming for Prompt Injection and Knowledge Corruption

Yanting Wang, Chenlong Yin, Ying Chen, Jinyuan Jia ยท 2026

Long-context large language models (LLMs)-for example, Gemini-3.1-Pro and Qwen-3.5-are widely used to empower many real-world applications, such as retrieval-augmented generation, autonomous agents, aโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Designing sparse temporal graphs satisfying connectivity requirements

Thomas Bellitto, Jules Bouton Popper, Justine Cauvi, Bruno Escoffier, Raphaelle Maistre-Matus ยท 2026

Connectivity of temporal graphs has been widely studied both as graph theory and as gossip theory. In particular, it is well known that in order to connect every vertex to every other, a temporal grapโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

On the Capacity of Hierarchical Secure Aggregation with Groupwise Keys

Minyang Lu, Zhou Li, Haiqiang Chen, Min Xie ยท 2026

We study the hierarchical secure aggregation problem with groupwise keys. The problem consists of an aggregation server, $U$ relays, and $UV$ users, where each relay serves $V$ disjoint users, and eacโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Hu\'i S\`u: Co-constructing a Dual Feedback Apparatus

Yichen Wang, Charles Patrick Martin ยท 2026

This performance presents a duet between two intelligent musical instruments, S\`u (to trace back; to go upstream) and Agentier (playing on agentic clavier), and their human performers, connected throโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Identification to Subclasses of Chordal Graphs

Petr A. Golovach, Laure Morelle, Daniel Paulusma ยท 2026

An identification of two vertices $u$ and $v$ in a graph replaces them with a new vertex whose neighborhood is the union of the neighborhoods of $u$ and $v$. We study the {\sc ${\cal H}$-Identificatioโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

On the complexity of edge subdivision to $H$-free graphs

Marta Piecyk, R. B. Sandeep ยท 2026

Subdividing an edge $uv$ in a graph replaces it by a path $u w v$ with one new vertex. For a graph $H$, the \textsc{$H$-free Subdivision} problem asks whether, given a graph $G$ and an integer $k$, onโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs

Mark de Berg, Bart M.P. Jansen, Jeroen S.K. Lamme ยท 2026

We study SINGLE-SOURCE SHORTEST PATH (SSSP) on unweighted intersection graphs whose node set corresponds to a set of $n$ constant-complexity objects in the plane. We prove SSSP can be solved in $O(U(nโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Counting All Lattice Rectangles in the Square Grid in Near-Linear Time

Dmitry Babichev, Sergey Babichev ยท 2026

We study the exact counting problem for all lattice rectangles contained in the square $[0,n)\times[0,n)$, including non-axis-parallel ones. Starting from the standard parametrization by a primitive dโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

A Model-Driven Approach to Database Migration with a Unified Data Model

Maria J. Ortin, Jose R. Hoyos, Jesus Garcia-Molina ยท 2026

Database migration is a key task in software modernization, increasingly involving transformations across heterogeneous data models such as relational and NoSQL systems. Existing approaches are typicaโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

AffectCity: An Empirical Investigation of Complexity, Transparency, and Materiality in Shaping Affective Perception of Building Facades

Chenxi Wang, Haining Ding, Michal Gath-Morad ยท 2026

Buildings shape how people feel, yet the mechanisms through which specific facade properties drive affective states remain empirically underspecified. Here we introduce the Cambridge Facade Affect Datโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Students Know AI Should Not Replace Thinking, but How Do They Regulate It? The TACO Framework for Human-AI Cognitive Partnership

Cecilia Ka Yuk Chan ยท 2026

As generative artificial intelligence becomes increasingly embedded in educational practice, a central concern is whether students use AI as cognitive support or as a substitute for thinking. Prior reโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Mismatch Capacity under Stochastic Decoding

Francesc Molina, Albert Guillen i Fabregas ยท 2026

This manuscript investigates channel capacity under mismatched stochastic likelihood decoding. We derive Feinstein- and Verd\'u-Han-style bounds on the error probability coded communication. These areโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Homogeneous Network Caching is Fixed-Parameter Tractable Parameterized by the Number of Caches

Jozsef Pinter, Regina Stangl ยท 2026

Network caching asks how to place contents in distributed caches so that future requests are served close to their users. Ganian, Mc Inerney and Tsigkari recently initiated the parameterized-complexitโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

A Quasi-Experiment comparing the health of unhoused people who have and have not experienced an eviction in King County, WA

Ihsan Kahveci, Timothy A. Thomas, Nathalie E. Williams, Janelle Rothfolk, Cathea Carey, Paul Hebert, Amy Hagopian, Zack W. Almquist ยท 2026

Home eviction poses a significant threat to housing stability, a critical determinant of health. This study examines the relationship between eviction and health and substance use within the unhoused โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

The Parameterized Complexity of Coloring Mixed Graphs

Antonio Lauerbach, Konstanty Junosza-Szaniawski, Marie Diana Sieper, Alexander Wolff ยท 2026

A mixed graph contains (undirected) edges as well as (directed) arcs, thus generalizing undirected and directed graphs. A proper coloring $c$ of a mixed graph $G$ assigns a positive integer to each veโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Orthogonal Strip Partitioning of Polygons: Lattice-Theoretic Algorithms and Lower Bounds

Jaehoon Chung ยท 2026

We study a variant of a polygon partition problem, introduced by Chung, Iwama, Liao, and Ahn [ISAAC'25]. Given orthogonal unit vectors $\mathbf{u},\mathbf{v}\in \mathbb{R}^2$ and a polygon $P$ with $nโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Efficient Fuzzy Private Set Intersection from Secret-shared OPRF

Xinpeng Yang, Meng Hao, Chenkai Weng, Robert H. Deng, Yonggang Wen, Tianwei Zhang ยท 2026

Private set intersection (PSI) enables a sender holding a set $Q$ of size $m$ and a receiver holding a set $W$ of size $n$ to securely compute the intersection $Q \cap W$. Fuzzy PSI (FPSI) is a PSI vaโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Uncertainty-aware Generative Learning Path Recommendation with Cognition-Adaptive Diffusion

Xiangrui Xiong, Hang Liang, Baiyang Chen, Zifei Pan, Yanli Lee ยท 2026

Learning Path Recommendation (LPR) is critical for personalized education, yet current methods often fail to account for historical interaction uncertainty (e.g., lucky guesses or accidental slips) anโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Parallel Algorithms for Group Isomorphism via Code Equivalence

Michael Levet ยท 2026

In this paper, we exhibit $\textsf{AC}^{3}$ isomorphism tests for coprime extensions $H \ltimes N$ where $H$ is elementary Abelian and $N$ is Abelian; and groups where $\text{Rad}(G) = Z(G)$ is elemenโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Recursive Completion in Higher K-Models: Front-Seed Semantics, Proof-Relevant Witnesses, and the K-Infinity Model

Daniel O. Martinez-Rivillas, Arthur F. Ramos, Ruy J. G. B. de Queiroz ยท 2026

Martinez-Rivillas and de Queiroz gave extensional Kan semantics for the untyped lambda-calculus and later constructed the concrete K-infinity homotopy-model. The two main mathematical results of the pโ€ฆ

Read Paper โ†’
Page 1 of 175 Next โ†’