3608 search results - page 362 / 722 » computing 2011 |
128
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
155
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
In this paper, we propose a novel multi-resolution background subtraction method. We adopt coarse to fine strategy, which is the essence the multi-resolution scheme, to obtain th...
134
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
In this paper, models and algorithms are presented for transcription of pitch and timings in polyphonic music extracts, focusing on the algorithm details of the sequential Markov ...
122
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper presents an efficient implementation of a robust adaptive beamforming algorithm based on convex optimization for applications in the processing-constrained environment...
162
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...