We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
Abstract— For multiple-input multiple-output (MIMO) systems, the optimum maximum likelihood (ML) detection requires tremendous complexity as the number of antennas or modulation ...
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
When distributing 3D contents real-time over a network with a narrow bandwidth such as a telephone line, methods for streaming and data compression can be considered indispensable...
Toshiki Hijiri, Kazuhiro Nishitani, Tim Cornish, T...
We address the problem of keyword spotting in continuous speech streams when training and testing conditions can be different. We propose a keyword spotting algorithm based on spa...