[HTML][HTML] 基于多尺度的改进Graph cut 算法
樊淑炎， 丁世飞 - 山东大学学报(工学版), 2016 - gxbwk.njournal.sdu.edu.cn
针对Graph cut 算法存在着计算复杂度高及可能出现过分割等不足, 提出了一种基于多尺度的
改进算法, 以更好地解决图像分割问题. 该算法将多尺度的Normalized cut 作为Graph cut …
改进算法, 以更好地解决图像分割问题. 该算法将多尺度的Normalized cut 作为Graph cut …
Design and evaluation of a parallel document clustering algorithm based on hierarchical latent semantic analysis
K Seshadri, KV Iyer - Concurrency and Computation: Practice …, 2019 - Wiley Online Library
We propose a parallel generalization scheme for Singular Value Decomposition–based
clustering algorithms. The scheme enables the clustering algorithm to generate a hierarchy …
clustering algorithms. The scheme enables the clustering algorithm to generate a hierarchy …
A scalable parallel algorithm for building web directories
K Seshadri, A Maruthappan… - Concurrency and …, 2021 - Wiley Online Library
Web directories like Wikipedia and Open Directory Mozilla facilitate efficient information
retrieval (IR) of web documents from a huge web corpus. Maintenance of these web …
retrieval (IR) of web documents from a huge web corpus. Maintenance of these web …
What quality signifies to the Big Data and Machine Learning industry?
KV Iyer - Available at SSRN 4698217, 2024 - papers.ssrn.com
A limited survey of ML techniques viewed from quality of output as implied by embedded
and explicit metrics (eg, optimization in LP, sensitivity analysis vs. possible binary …
and explicit metrics (eg, optimization in LP, sensitivity analysis vs. possible binary …