Browsing by Keywords "Randomized algorithms"

Now showing items 1-3 of 3

    • Cascade-aware partitioning of large graph databases 

      Demirci, Gündüz Vehbi; Ferhatosmanoğlu, H.; Aykanat, Cevdet (Springer, 2019)
      Graph partitioning is an essential task for scalable data management and analysis. The current partitioning methods utilize the structure of the graph, and the query log if available. Some queries performed on the database ...

    • Online classification via self-organizing space partitioning 

      Ozkan, H.; Vanli, N. D.; Kozat, S. S. (Institute of Electrical and Electronics Engineers Inc., 2016)
      The authors study online supervised learning under the empirical zero-one loss and introduce a novel classification algorithm with strong theoretical guarantees. The proposed method is a highly dynamical self-organizing ...

    • Partitioning models for scaling distributed graph computations 

      Demirci, Gündüz Vehbi (Bilkent University, 2019-08)
      The focus of this thesis is intelligent partitioning models and methods for scaling the performance of parallel graph computations on distributed-memory systems. Distributed databases utilize graph partitioning to provide ...