In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
This paper presents a method for building genetic language taxonomies based on a new approach to comparing lexical forms. Instead of comparing forms cross-linguistically, a matrix...
The Temporal Coding Hypothesis of Miller and colleagues [7] suggests that animals integrate related temporal patterns of stimuli into single memory representations. We formalize t...
Abstract. Dittmann, Katzenbeisser, Schallhart and Veith (IACR ePrint 2004) introduced the notion of invertible media authentication schemes, embedding authentication data in media ...
Motivation: Evaluating the accuracy of predicted models is critical for assessing structure prediction methods. Because this problem is not trivial, a large number of different as...
Naomi Siew, Arne Elofsson, Leszek Rychlewski, Dani...