The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
In this paper, we introduce a novel bayesian compressive sensing (CS) technique for phonetic classification. CS is often used to characterize a signal from a few support training...
Tara N. Sainath, Avishy Carmi, Dimitri Kanevsky, B...
Named entity recognition studies the problem of locating and classifying parts of free text into a set of predefined categories. Although extensive research has focused on the de...
We prove a collection of conjectures of D. White [37], as well as some related conjectures of Abuzzahab-Korson-Li-Meyer [1] and of Reiner and White [21], [37], regarding the cyclic...
Abstract. Webs of trust constitute a decentralized infrastructure for establishing the authenticity of the binding between public keys and users and, more generally, trust relation...
Michael Backes, Stefan Lorenz, Matteo Maffei, Kim ...