Using machine learning for quantum annealing accuracy prediction
A Barbosa, E Pelofske, G Hahn, HN Djidjev
Algorithms 14 (6), 187, 2021
Reducing quantum annealing biases for solving the graph partitioning problem
E Pelofske, G Hahn, HN Djidjev
Proceedings of the 18th ACM International Conference on Computing Frontiers, 2021
Embedding algorithms for quantum annealers with chimera and pegasus connection topologies
S Zbinden, A Bärtschi, H Djidjev, S Eidenbenz
International Conference on High Performance Computing, 187-206, 2020
Inferring the Dynamics of the State Evolution During Quantum Annealing
E Pelofske, G Hahn, HN Djidjev
IEEE Transactions on Parallel and Distributed Systems, 2020
Distributed non-negative matrix factorization with determination of the number of latent features
G Chennupati, R Vangara, E Skau, H Djidjev, B Alexandrov
The Journal of Supercomputing, 1-31, 2020.
Advanced anneal paths for improved quantum annealing
E Pelofske, G Hahn, H Djidjev
IEEE International Conference on Quantum Computing and Engineering, 2020.
Embedding inequality constraints for quantum annealing optimization
T Vyskočil, S Pakin, HN Djidjev
International workshop on quantum technology and optimization problems, 2019
Coverage Problems in Sensor Networks.
Hristo Djidjev, Miodrag Potkonjak.
a chapter in Intelligent Sensor Networks: Across Sensing, Signal Processing, and Machine Learning, CRC Press, 2012.
Scalable and Accurate Graph Clustering and Community Structure Detection.
Hristo Djidjev, Melih Onus.
IEEE Transactions on Parallel and Distributed Systems, vol 99, no. preprint, 2012.
Approximate Distance Queries for Weighted Polyhedral Surfaces.
Hristo Djidjev, Christian Sommer
European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, vol. 6942, pp. 579--590, 2011.
Graph Based Statistical Analysis of Network Traffic
Hristo Djidjev, Gary Sandine, Curtis Storlie, Scott Vander Wiel
Mining and Learning with Graphs (MLG), San Diego, August 2011.
Approximation algorithms for computing minimum exposure paths in a sensor field.
Hristo Djidjev.
ACM Transactions of Sensor Networks vol. 7, no. 3, pp. 1-23, 2010.
A faster algorithm for computing the girth of planar and bounded genus graphs
Hristo Djidjev.
ACM Transactions on Algorithms (TALG), 2010.