A reconstruction problem of words from scattered factors asks for the minimal information, like multisets a given length or number occurrences set, necessary to uniquely determine word. We show that word [Formula: see text] can be reconstructed at most form text], where is letter in text]. Moreover, we generalise result alphabets by showing suffices reconstruct Both results improve on upper bou...

Dutch-learning and English-learning 9-month-olds were tested, using the Headturn Preference Procedure, for their ability to segment Dutch words with strong/weak stress patterns from fluent Dutch speech. This prosodic pattern is highly typical for words of both languages. The infants were familiarized with pairs of words and then tested on four passages, two that included the familiarized words ...

We present a unified method for recovering from tracking failure and closing loops in real time monocular simultaneous localisation and mapping. Within a graph-based map representation, we show that recovery and loop closing both reduce to the creation of a graph edge. We describe and implement a bag-of-words appearance model for ranking potential loop closures, and a robust method for using bo...

The timing and temporal order are two characteristic properties that are frequently omitted in machine learning approaches, but carry crucial information. Their consideration is currently limited to algorithms that are specialized to sequential data, but it takes a projection into a vector space to employ the wealth of ML algorithms that are known and understood. Projections inevitably cause a ...