1909 search results - page 43 / 382 » Generalized Filtering Decomposition |
114
Voted
TNN
2010
14 years 7 months ago
2010
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...
105
click to vote
AMAI
1999
Springer
15 years 3 days ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
83
Voted
ICASSP
2009
IEEE
15 years 7 months ago
2009
IEEE
Sparse Decomposition (SD) of a signal on an overcomplete dictionary has recently attracted a lot of interest in signal processing and statistics, because of its potential applicat...
103
click to vote
FAC
2010
14 years 11 months ago
2010
For more than a decade, the trend in geometric constraint systems solving has been to use a geometric decomposition/recombination approach. These methods are generally grounded on...
115
click to vote
TIP
2008
15 years 9 days ago
2008
Abstract--In this paper, we analyze the computational challenges in implementing particle filtering, especially to video sequences. Particle filtering is a technique used for filte...