10608 search results - page 223 / 2122 » Complexity of O'Hara's Algorithm |
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
92
Voted
ICASSP
2009
IEEE
15 years 7 months ago
2009
IEEE
Although noise PSD estimation is a crucial part of noise reduction algorithms, most noise PSD estimators have problems in tracking non-stationary noise sources. Recently, a noise ...
119
click to vote
WG
2009
Springer
15 years 7 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
112
Voted
CSR
2009
Springer
15 years 7 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...