1554 search results - page 31 / 311 » Parameterized Complexity and Approximation Algorithms |
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
We propose a variant of Orthogonal Matching Pursuit (OMP), called LoCOMP, for scalable sparse signal approximation. The algorithm is designed for shift-invariant signal dictionari...
102
Voted
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
For successful SoC design, efficient and scalable communication architecture is crucial. Some bus interconnects now provide configurable structures to meet this requirement of an ...
CIE
2007
Springer
15 years 4 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
ICRA
2008
IEEE
15 years 4 months ago
2008
IEEE
— The lack of a parameterized observation model in robot localization using occupancy grids requires the application of sampling-based methods, or particle filters. This work ad...
FOCS
2006
IEEE
15 years 4 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...