GC
2002
Springer
13 years 4 months ago
2002
Springer
We prove that for every c > 0 there exists a constant K = K(c) such that every graph G with n vertices and minimum degree at least cn contains a cycle of length t for every even...
ICIP
2006
IEEE
14 years 6 months ago
2006
IEEE
Particle filters have been introduced as a powerful tool to estimate the posterior density of nonlinear systems. These filters are also capable of processing data online as requir...