Given a connected, undirected graph G whose edges are labeled (or colored), the minimum labeling spanning tree (MLST) problem seeks a spanning tree on G with the minimum number of distinct labels (or ...

Naturally, we further propose the corresponding instantaneous M-estimate MEE (IM-MEE) criterion and apply it to adaptive filtering. A robust recursive adaptive filtering algorithm, called the ...