79 search results - page 4 / 16 » Remarks on solutions of a fourth-order problem |
ICASSP
2009
IEEE
14 years 3 months ago
2009
IEEE
In the last few years, we have witnessed an explosion in applications of sparse representation, the majority of which share the need for finding sparse solutions of underdetermine...
JUCS
2000
13 years 8 months ago
2000
: Studying the architectural evolution of mainstream field programmable gate arrays (FPGAs) leads to the following remark: in these circuits, the proportion of silicon devoted to r...
ICEC
1994
13 years 10 months ago
1994
Combinatorial optimization problems require computing efforts which grow at least exponentially with the problem dimension. Therefore, the use of the remarkable power of massively...
ICRA
1993
IEEE
14 years 20 days ago
1993
IEEE
An issue central to the navigation problem is memory. Traditional systems build symbolic maps of the world for navigational reference. Reactive methods, in contrast, eliminate or m...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...