Primoz Skraba

Learn More
We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomized algorithm for network desynchronization that uses an extremely lightweight model of computation, while being robust to link volatility and node failure. These techniques also(More)
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-based hill-climbing scheme, the novelty of our approach resides in its use of <i>topological persistence</i> to guide the merging of clusters. Our algorithm provides additional(More)
Given a real-valued function f defined over some metric space X, is it possible to recover some structural information about f from the sole information of its values at a finite set L ⊆ X of sample points, whose pairwise distances in X are given? We provide a positive answer to this question. More precisely, taking advantage of recent advances on the front(More)
In this paper, we combine two ideas: persistence-based clustering and the Heat Kernel Signature (HKS) function to obtain a multi-scale isometry invariant mesh segmentation algorithm. The key advantages of this approach is that it is tunable through a few intuitive parameters and is stable under near-isometric deformations. Indeed the method comes with(More)
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of simplex additions and deletions. Provided that there is an algorithm that multiplies two n&#215;n matrices in M(n) time, our algorithm runs in O(M(n) + n<sup>2</sup> log<sup>2</sup>(More)
Communication between nodes in mobile ad-hoc networks is a daunting challenge. The dynamic nature of the environment results in a rapidly changing network topology. This paper presents a cross-layer optimization approach and proposes a routing protocol for achieving minimal delay for energy efficient communication in a dynamic multi-hop ad-hoc environment.(More)
Recently, multi-scale notions of local homology (a variant of persistent homology) have been used to study the local structure of spaces around a given point from a point cloud sample. Current reconstruction guarantees rely on constructing embedded complexes which become difficult in high dimensions. We show that the persistence diagrams used for estimating(More)
Canonical correlation analysis is a statistical technique that is used to find relations between two sets of variables. An important extension in pattern analysis is to consider more than two sets of variables. This problem can be expressed as a quadratically constrained quadratic program (QCQP), commonly referred to Multi-set Canonical Correlation Analysis(More)
We present a robust approach to data collection, aggregation, and dissemination problems in sensor networks. Our method is based on the idea of a <i>sweep</i> over the network: a wavefront that traverses the network, passes over each node exactly once, and performs the desired operation(s). We do not require global information about the sensor field such as(More)
The resource limited nature of WSNs require that protocols implemented on these networks be energy-efficient, scalable and distributed. This paper presents an analysis of a novel combined routing and MAC protocol. The protocol achieves energy-efficiency by minimizing signaling overhead through state-less routing decisions that are made at the receiver(More)