Related papers: The Broken Stick Project
Microtask crowdsourcing is the practice of breaking down an overarching task to be performed into numerous, small, and quick microtasks that are distributed to an unknown, large set of workers. Microtask crowdsourcing has shown potential in…
We address the problem of detection and estimation of one or two change-points in the mean of a series of random variables. We use the formalism of set estimation in regression: To each point of a design is attached a binary label that…
In this paper, we consider convex feasibility problems where the underlying sets are loosely coupled, and we propose several algorithms to solve such problems in a distributed manner. These algorithms are obtained by applying proximal…
In many schools throughout the United States, it is customary to hold a yearly "Secret Santa" event. With the approach of Christmas, all the students place their names in a hat; each student, in turn, draws a name out of the hat, thus…
The prediction of academic dropout, with the aim of preventing it, is one of the current challenges of higher education institutions. Machine learning techniques are a great ally in this task. However, attention is needed in the way that…
Drawing on the Data and Predictions strand of the Indicazioni Nazionali per il curricolo 2012, this study proposes a problem based instructional approach to the teaching of probability. More specifically, the study adopts a design based…
We study the problem of how to breakup many point sets in $\mathbb{R}^d$ into smaller parts using a few splitting (shared) hyperplanes. This problem is related to the classical Ham-Sandwich Theorem. We provide a logarithmic approximation to…
"The Price of Robustness" by Bertsimas and Sim represented a breakthrough in the development of a tractable robust counterpart of Linear Programming Problems. However, the central modeling assumption that the deviation band of each…
This paper is one of a series in which elementary-education practice is analyzed by comparison with the history of mathematics, mathematical structure, modern practice, and (occasionally) cognitive neuroscience. The primary concerns are:…
The Closest String Problem is an NP-hard problem that aims to find a string that has the minimum distance from all sequences that belong to the given set of strings. Its applications can be found in coding theory, computational biology, and…
This paper considers the triangle finding problem in the CONGEST model of distributed computing. Recent works by Izumi and Le Gall (PODC'17), Chang, Pettie and Zhang (SODA'19) and Chang and Saranurak (PODC'19) have successively reduced the…
In this paper we first study the isoperimetric problem in the case of integer triangles, as well as Alcuin's sequence and how it relates to the number of different integer triangles with a given perimeter. We then present and compare two…
The distance of a graph from being triangle-free is a fundamental graph parameter, counting the number of edges that need to be removed from a graph in order for it to become triangle-free. Its corresponding computational problem is the…
We consider the problem of revealing a small hidden lattice from the knowledge of a low-rank sublattice modulo a given sufficiently large integer -- the {\em Hidden Lattice Problem}. A central motivation of study for this problem is the…
The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…
We consider a classical analogue of the well known quantum two-slit experiment. Charged particles are scattered on flat screen with two slits and hit the second screen. We show that the probability distribution on the second screen when…
An original approach to solving rather difficult probabilistic problems arising in studying the readout of random discrete fields and having no exact analytical solutions at the moment is proposed. Several algorithms for direct, iterative,…
Consider the Hitting Set problem where, for a given universe $\mathcal{X} = \left\{ 1, ... , n \right\}$ and a collection of subsets $\mathcal{S}_1, ... , \mathcal{S}_m$, one seeks to identify the smallest subset of $\mathcal{X}$ which has…
We revisit the algorithmic problem of finding a triangle in a graph (\textsc{Triangle Detection}), and examine its relation to other problems such as \textsc{3Sum}, \textsc{Independent Set}, and \textsc{Graph Coloring}. We obtain several…
Our object of study is the general class of stick-breaking processes with exchangeable length variables. These generalize well-known Bayesian non-parametric priors in an unexplored direction. We give conditions to assure the respective…