7 citations · 20 across the 14 of their papers we have counts for
17 papers
Sequential Universal Modeling for Non-Binary Sequences with Constrained Distributions
Michael Drmota, Gil Shamir, Wojciech Szpankowski
Sequential probability assignment and universal compression go hand in hand. We propose sequential probability assignment for non-binary (and large alphabet) sequences with empiric…
Hidden Words Statistics for Large Patterns
Svante Janson, Wojciech Szpankowski
We study here the so called subsequence pattern matching also known as hidden pattern matching in which one searches for a given pattern of length as a subsequence in a ran…
Temporal Ordered Clustering in Dynamic Networks: Unsupervised and Semi-supervised Learning Algorithms
Krzysztof Turowski, Jithin K. Sreedharan, Wojciech Szpankowski
In temporal ordered clustering, given a single snapshot of a dynamic network in which nodes arrive at distinct time instants, we aim at partitioning its nodes into ordered clus…
Toward Universal Testing of Dynamic Network Models
Abram Magner, Wojciech Szpankowski
Numerous networks in the real world change over time, in the sense that nodes and edges enter and leave the networks. Various dynamic random graph models have been proposed to expl…
Joint String Complexity for Markov Sources: Small Data Matters
Philippe Jacquet, Dimitris Milioris, Wojciech Szpankowski
String complexity is defined as the cardinality of a set of all distinct words (factors) of a given string. For two strings, we introduce the joint string complexity as the cardina…
Randomized Linear Algebra Approaches to Estimate the Von Neumann Entropy of Density Matrices
Eugenia-Maria Kontopoulou, Gregory-Paul Dexter, Wojciech Szpankowski +2
Thevon Neumann entropy, named after John von Neumann, is an extension of the classical concept of entropy to the field of quantum mechanics. From a numerical perspective, von Neuma…