We present the design, implementation, and evaluation of a multi-sensor, low-power
necklace, NeckSense, for automatically and unobtrusively capturing fine-grained information …

The subject of this paper is the time complexity of approximating Knapsack, Subset Sum,
Partition, and some other related problems. The main result is an Õ (n+ 1/ε 5/3) time …

Since an increasing number of problems in P have conditional lower bounds against exact
algorithms, it is natural to study which of these problems can be efficiently approximated …

Periodic group behaviors often exist in temporal interaction networks, such as monthly group
meetings, quarterly animal migrations, and yearly birthday parties. In real life, these events …

Cadences are syntactic regularities in strings, of the family of periods, squares, and
repetitions. We say a string has a cadence if a certain character is repeated at regular …

Periodicity has been historically well studied and has numerous applications. In nature,
however, few cyclic phenomena have an exact period. This paper surveys some recent …

Abstract Given ϵ∈[0, 1), the ϵ-Relative Error Periodic Pattern Problem (REPP) is the
following: INPUT: An n-long sequence S of numbers si∈ N in increasing order. OUTPUT …

Wearable-based human activity recognition is well-studied in the machine learning and
pervasive computing community. A large corpus of studies focused on using wearable …

The problem of finding the period of a vector V is central to many applications. Let V′ be a
periodic vector closest to V under some metric. We seek this V′, or more precisely we seek …

The k-anticover of a string S is a set of distinct k-length substrings such that every index in S
is contained in one of these substrings. The existence of an anticover indicates a lack of …