New Scientist

Peter Shor’s algorithm could break the internet – but he's not worried

Few people have invented an algorithm with the potential to spark a worldwide crisis, so why is quantum computing pioneer ...
IEEE

Balanced and Discrete Multi-View Clustering With Adaptive Graph Learning

Abstract: Graph-based methods have demonstrated strong performance in multi-view clustering (MVC) due to their capability to capture complex data structures. Among these, discrete spectral embedding ...
IEEE

Fast FPGA Accelerator of Graph Cut Algorithm With Threshold Global Relabel and Inertial Push

Abstract: Graph cut algorithms are popular in optimization tasks related to min-cut and max-flow problems. However, modern FPGA graph cut algorithm accelerators still need performance and memory ...
archive

Discrete optimization algorithms : with Pascal programs

Please Don't Scroll Past This Can you chip in? The Internet Archive partners with libraries, archives, and institutions across the globe to preserve cultural heritage that would otherwise be lost ...