Search Results for author:
Found 4 papers, 2 papers with code
On Narrative Information and the Distillation of Stories
We then demonstrate how evolutionary algorithms can leverage this to extract a set of narrative templates and how these templates -- in tandem with a novel curve-fitting algorithm we introduce -- can reorder music albums to automatically induce stories in them.
Automatic Embedding of Stories Into Collections of Independent Media
We look at how machine learning techniques that derive properties of items in a collection of independent media can be used to automatically embed stories into such collections.
A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time
We also give a better approximation guarantee in the special case of Directed Latency in regret metrics where the goal is to find a path $P$ minimize the average time a node $v$ waits in excess of $c_{rv}$, i. e. $\frac{1}{|V|} \cdot \sum_{v \in V} (c_v(P)-c_{rv})$.
Data Structures and Algorithms
Local Search Yields a PTAS for k-Means in Doubling Metrics
The most well known and ubiquitous clustering problem encountered in nearly every branch of science is undoubtedly $k$-means: given a set of data points and a parameter $k$, select $k$ centres and partition the data points into $k$ clusters around these centres so that the sum of squares of distances of the points to their cluster centre is minimized.
