Default-sensitive preprocessings for finding maxima

MaRDI QIDQ4953351zbMATH OpenFDO

Authors Wing-Kin Sung, Ming-Yang Kao, Tak-Wah Lam, Hing-Fung Ting

Publication date 9 May 2000

zbMATH Keywords

fast preprocessing algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Maxima-finding algorithms for multidimensional samples: A two-phase approach
• On preprocessing for weighted MaxSAT
• Minimization of the maximum deviation with preemption
• Self-improving algorithms for coordinate-wise maxima
• A provably fast linear-expected-time maxima-finding algorithm
• Efficient computation for the noisy MAX
• scientific article; zbMATH DE number 2038886
• Finding the maximum with linear error probabilities: a sequential analysis approach
• A volume first maxima-finding algorithm
• scientific article; zbMATH DE number 3942321

Cited in

(2)

• Maxima-finding algorithms for multidimensional samples: A two-phase approach
• Continuity focused choice of maxima: Yet another defuzzification method

This page was built for publication: Default-sensitive preprocessings for finding maxima

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953351)