15033 search results - page 357 / 3007 » Complexity Theory and Algorithms |
207
click to vote
CIKM
2008
Springer
15 years 9 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...
177
click to vote
ICASSP
2010
IEEE
15 years 7 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...
187
click to vote
AUTOMATICA
2008
15 years 7 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...
153
click to vote
ENTCS
2008
15 years 7 months ago
2008
Efficient handling of quantifiers is crucial for solving software verification problems. E-matching algorithms are used in satisfiability modulo theories solvers that handle quant...
173
click to vote
SOFSEM
2009
Springer
16 years 4 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...