Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
Charles E. Leiserson, Marc Moreno Maza, Liyun Li, ...
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
: This paper discusses the speech morphing process showing some limitations of using the directly obtained LPC and excitation parameters of speech. The algorithm here depends on ch...
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
We analyze the Synchrosqueezing transform, a consistent and invertible time-frequency analysis tool that can identify and extract oscillating components (of time-varying frequency...
Eugene Brevdo, Neven S. Fuckar, Gaurav Thakur, Hau...