10988 search results - page 138 / 2198 » Algorithmic Folding Complexity |
109
click to vote
STOC
1996
ACM
15 years 6 months ago
1996
ACM
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...
137
Voted
CIKM
2008
Springer
15 years 4 months ago
2008
Springer
Searching data streams has been traditionally very limited, either in the complexity of the search or in the size of the searched dataset. In this paper, we investigate the design...
114
Voted
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
Most speech enhancement algorithms heavily depend on the noise power spectral density (PSD). Because this quantity is unknown in practice, estimation from the noisy data is necess...
123
click to vote
AUTOMATICA
2008
15 years 2 months ago
2008
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
141
Voted
CIVR
2009
Springer
15 years 9 months ago
2009
Springer
We start from the state-of-the-art Bag of Words pipeline that in the 2008 benchmarks of TRECvid and PASCAL yielded the best performance scores. We have contributed to that pipelin...