3270 search results - page 264 / 654 » Approximate String Processing |
133
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...
115
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
The goal of this work was to explore modeling techniques to improve bird species classification from audio samples. We first developed an unsupervised approach to obtain approxima...
78
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Unit selection synthesis inventories have coverage issues, which lead to missing syllable or diphone units. In the conventional back-off strategy of substituting the missing unit ...
115
Voted
ICASSP
2011
IEEE
14 years 7 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...
129
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...