Sciweavers

620 search results - page 42 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
TSP
2008
134views more  TSP 2008»
15 years 2 months ago
Computational Algorithms for Wavelet Identification of Nonlinearities in Hammerstein Systems With Random Inputs
Abstract-- Simple and efficient computational algorithms for nonparametric wavelet-based identification of nonlinearities in Hammerstein systems driven by random signals are propos...
Przemyslaw Sliwinski, Zygmunt Hasiewicz
BMVC
2000
15 years 3 months ago
Morphological Change Detection Algorithms for Surveillance Applications
Vision-based systems for remote surveillance usually involve change detection algorithms for intruders, obstacles or irregularities detection. In particular, there is a potentiall...
Elena Stringa
126
Voted
ICPR
2002
IEEE
16 years 3 months ago
The Trimmed Iterative Closest Point Algorithm
The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension o...
Dmitry Chetverikov, D. Svirko, Dmitry Stepanov, Pa...
ESA
2005
Springer
93views Algorithms» more  ESA 2005»
15 years 8 months ago
New Tools and Simpler Algorithms for Branchwidth
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
Christophe Paul, Jan Arne Telle
119
Voted
SIP
2001
15 years 3 months ago
Convergence acceleration of the LMS algorithm using successive data orthogonalization
We propose a new adaptive filtering algorithm whose convergence rate is very fast even for a highly correlated input signal. It is well-known that convergence rate gets worse when...
H.-C. Shin, W.-J. Song