Sciweavers

10414 search results - page 253 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
ESANN
2003
15 years 7 months ago
Comparison of neural algorithms for blind source separation in sensor array applications
- A test bed of experiments with real and artificially generated data has been designed to compare the performance of three well-known algorithms for BSS. The main goal of these ex...
Guillermo Bedoya, Sergio Bermejo, Joan Cabestany
IJON
2008
124views more  IJON 2008»
15 years 6 months ago
A dynamic algorithm for blind separation of convolutive sound mixtures
We study an efficient dynamic blind source separation algorithm of convolutive sound mixtures based on updating statistical information in the frequency domain, and minimizing the...
Jie Liu, Jack Xin, Yingyong Qi
IPL
2008
114views more  IPL 2008»
15 years 6 months ago
Faster algorithms for guided tree edit distance
The guided tree edit distance problem is to find a minimum cost series of edit operations that transforms two input forests F and G into isomorphic forests F and G such that a thi...
Dekel Tsur
TOMACS
2008
91views more  TOMACS 2008»
15 years 6 months ago
On constructing optimistic simulation algorithms for the discrete event system specification
abstractly; it is intended to provide a basis for implementing efficient and scalable parallel algorithms that correctly simulate DEVS models. Categories and Subject Descriptors: I...
James J. Nutaro
COMCOM
1999
81views more  COMCOM 1999»
15 years 6 months ago
Fast knockout algorithm for self-route concentration
Concentration has been a popular technique for resolving contention in switching. In particular, self-route concentration is useful inside ATM switching fabrics in many ways. This...
Shuo-Yen Robert Li, Hui Li, Gar Man Koo