Sciweavers

1258 search results - page 103 / 252
» Architecture-driven Problem Decomposition
Sort
View
TSP
2010
13 years 3 months ago
Code design for radar STAP via optimization theory
Abstract--In this paper, we deal with the problem of constrained code optimization for radar space-time adaptive processing (STAP) in the presence of colored Gaussian disturbance. ...
Antonio De Maio, Silvio De Nicola, Yongwei Huang, ...
ICIP
2000
IEEE
14 years 10 months ago
Shape Approximation Through Recursive Scalable Layer Generation
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
Gerry Melnikov, Aggelos K. Katsaggelos
ICASSP
2010
IEEE
13 years 7 months ago
A hierarchical Bayesian model for frame representation
In many signal processing problems, it may be fruitful to represent the signal under study in a redundant linear decomposition called a frame. If a probabilistic approach is adopt...
Lotfi Chaâri, Jean-Christophe Pesquet, Jean-...
WG
2010
Springer
13 years 7 months ago
On the Small Cycle Transversal of Planar Graphs
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
Ge Xia, Yong Zhang
TNN
2010
148views Management» more  TNN 2010»
13 years 3 months ago
Generalized low-rank approximations of matrices revisited
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...
Jun Liu, Songcan Chen, Zhi-Hua Zhou, Xiaoyang Tan