This paper introduces a semi-supervised distance metric learning algorithm which uses pair-wise equivalence (similarity and dissimilarity) constraints to improve the original dist...
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, St&e...
We consider adaptive two-channel multiple-description coding. We provide an analytical method for designing a resolutionconstrained symmetrical multiple-description coder that use...
Janusz Klejsa, Marcin Kuropatwinski, W. Bastiaan K...
Abstract. The race condition checker rccjava uses a formal type system to statically identify potential race conditions in concurrent Java programs, but it requires programmer-supp...
We present an algorithm to perform blind, one-microphone speech separation. Our algorithm separates mixtures of speech without modeling individual speakers. Instead, we formulate ...