Research
Research
Research
Research
173+ open-access research outputs.
Retrieving relevant past interactions from long-term conversational memory typically relies on large dense retrieval models (110M-1.5B parameters) or LLM-augmented indexing. We introduce SelRoute, a f…
In this paper, we extend a necessary and sufficient condition for a linear code over a Galois ring to be minimal and establish new bounds on the length of an $m$-dimensional minimal linear code. Bui…
In recent years, the construction of non-GRS type linear codes has attracted considerable attention due to that they can effectively resist both the Sidelnikov-Shestakov attack and the Wieschebrink at…
We initiate the study of single-sample bilateral trade with a broker, drawing an analogy to the setting of single-sample bilateral trade without a broker considered in Babaioff et al. (2020) and Cai a…
We study the problem of constructing explicit codes whose rate and distance match the Gilbert-Varshamov bound in the low-rate, high-distance regime. In 2017, Ta-Shma gave an explicit family of codes w…
Speech processing for low-resource dialects remains a fundamental challenge in developing inclusive and robust speech technologies. Despite its linguistic significance and large speaker population, th…
Visual Reasoning CAPTCHAs (VRCs) combine visual scenes with natural-language queries that demand compositional inference over objects, attributes, and spatial relations. They are increasingly deployed…
In moldable job scheduling, we are provided $m$ identical machines and $n$ jobs that can be executed on a variable number of machines. The execution time of each job depends on the number of machines …
High enrollment in STEM-related degree programs has created increasing demand for scalable tutoring support, as universities experience a shortage of qualified instructors and teaching assistants (TAs…
Linear codes with few weights have been a significant area of research in coding theory for many years, due to their applications in secret sharing schemes, authentication codes, association schemes, …
We consider the problem of allocating $m$ indivisible chores among $n$ agents with possibly different weights, aiming for a solution that is both fair and efficient. Specifically, we focus on the clas…
A fundamental problem in shape matching and geometric similarity is computing the maximum area overlap between two polygons under translation. For general simple polygons, the best-known algorithm run…
Randomness plays a pivotal yet paradoxical role in computational music creativity: it can spark novelty, but unchecked chance risks incoherence. This paper presents a thematic review of contemporary A…
It's well-known that maximum distance separable codes (in short, MDS) and linear complementary dual (in short, LCD) codes are very important in coding theory and practice. In 2023, Yue et al. [25] con…
The conventional approach in differential privacy (DP) literature formulates the privacy-utility trade-off with a "privacy-first" perspective: for a predetermined level of privacy, a certain utility i…
We study the fair division of indivisible chores among agents with additive disutility functions. We investigate the existence of allocations satisfying the popular fairness notion of envy-freeness up…
We present a $0.659$-competitive Quadratic Ranking algorithm for the Oblivious Bipartite Matching problem, a distribution-free version of Query-Commit Matching. This result breaks the $1-\frac{1}{e}$ …
We study the problem of fair division of indivisible chores among $n$ agents in an online setting, where items arrive sequentially and must be allocated irrevocably upon arrival. The goal is to produc…
Adolescents' mobile technology use is often regulated through rigid control mechanisms that fail to account for their autonomy and natural usage patterns. Drawing on Taoist philosophy, particularly Wu…
Due to their numerous applications, in particular in Mechanism Design, Prophet Inequalities have experienced a surge of interest. They describe competitive ratios for basic stopping time problems wher…
Free open-access publishing with Google Scholar indexing.
Submission Guide →