Large language models (LLMs) provide round-the-clock personalized programming assistance, unlike course instructors or traditional online information sources such as Stack Overflow. While LLMs can aid in code generation, concerns about over-reliance and ...

This paper considers polyphonic pattern matching in symbolically encoded music under transposition invariance. We show how, in two specific retrieval problems, the worst-case time complexities can be improved by an order of magnitude by applying a ...

The rapid evolution of programming languages in recent years has introduced new languages, tools, libraries, and technologies. Python has emerged as a prevalent programming language, leading many institutions and universities to adopt it as the default ...

Learning and teaching at scale became especially topical and important matters due to the COVID-19 pandemic. The obvious way to that end is to use Massive Open Online Courses (MOOCs). However, the pedagogics and student behaviour between online and ...

SIA is a fundamental algorithm in symbolic musical pattern discovery, which reports all maximal translatable patterns in a point set. The original SIA algorithm requires $O(k{n}^{2}logn)$ time and $O(k{n}^2)$ space, where n is the number of points in the data ...

This paper presents an algorithm for the time-scaled repeated pattern discovery problem in symbolic music. Given a set of n notes represented as geometric points, the algorithm reports all time-scaled repetitions in the point set. The idea of the ...${}^{\mathrm{}}$${}^{\mathrm{}}$

Finding repetitions in music is a fundamental music information retrieval problem that has several scientific and engineering applications. A popular algorithm for the problem is , the structure induction algorithm developed by Meredith et. al. [10]. is ...

Let A _q (n, d) denote the maximum size of a q-ary code with length n and minimum distance d. For most values of n and d, only lower and upper bounds on A _q (n, d) are known. In this paper new lower bounds on and updated tables of A _q (n, d) for q ∈ {...

We study medium access control layer random access under the assumption that the receiver can perform successive interference cancellation, without feedback. During recent years, a number of protocols with impressive error performance have been suggested ...

This invaluable textbook presents a comprehensive introduction to modern competitive programming. The text highlights how competitive programming has proven to be an excellent way to learn algorithms, by encouraging the design of algorithms that ...

Transitive permutation groups are recurrent in the study of automorphism groups of combinatorial objects. For binary error-correcting codes, groups are here considered that act transitively on the pairs of coordinates and coordinate values. By ...

This paper focuses on two-dimensional point set pattern matching with horizontal scaling. Given a dataset S of n points and a pattern P of m points, the task is to find occurrences of P in S. The pattern may be horizontally scaled using a constant ...

A great CS assignment is a delight to all, but the path to one can be most roundabout. Many CS students have had their characters built up on assignments that worked better as an idea than as an actual assignment. Assignments are hard to come up with, ...

Automatic chord transcription is the process of transforming the harmonic content of a music signal into chord symbols. We use difficult chord transcription cases in the Beatles material to compare human performance to computer performance. ...

Mapping short DNA reads to the reference genome is the core task in the recent high-throughput technologies to study e.g. protein-DNA interactions (ChIP-seq) and alternative splicing (RNA-seq). Several tools for the task (bowtie, bwa, SOAP2, TopHat) ...