Now showing items 1-8 of 8

    • Counteracting free riding in Peer-to-Peer networks 

      Karakaya, M.; Körpeoǧlu, I.; Ulusoy, O. (Elsevier BV, 2008-03)
      The existence of a high degree of free riding is a serious threat to Peer-to-Peer (P2P) networks. In this paper, we propose a distributed framework to reduce the adverse effects of free riding on P2P networks. Our solution ...
    • Distributed construction and maintenance of bandwidth and energy efficient bluetooth scatternets 

      Tekkalmaz, M.; Sözer, H.; Korpeoglu, I. (Institute of Electrical and Electronics Engineers, 2006-09)
      Bluetooth networks can be constructed as piconets or scatternets depending on the number of nodes in the network. Although piconet construction is a well-defined process specified in Bluetooth standards, scatternet formation ...
    • Distributed k-Core view materialization and maintenance for large dynamic graphs 

      Aksu, H.; Canim, M.; Chang, Yuan-Chi; Korpeoglu, I.; Ulusoy, O. (Institute of Electrical and Electronics Engineers, 2014-10)
      In graph theory, k-core is a key metric used to identify subgraphs of high cohesion, also known as the ‘dense’ regions of a graph. As the real world graphs such as social network graphs grow in size, the contents get ...
    • Free riding in peer-to-peer networks 

      Karakaya, M.; Korpeoglu, I.; Ulusoy, Ö. (Institute of Electrical and Electronics Engineers, 2009)
      Free riding in peer-to-peer (P2P) networks poses a serious threat to their proper operation. Here, the authors present a variety of approaches developed to overcome this problem. They introduce several unique aspects of ...
    • Graph aware caching policy for distributed graph stores 

      Aksu, Hidayet; Canım, M.; Chang, Y.-C.; Körpeoğlu, İbrahim; Ulusoy, Özgür (IEEE, 2015-03)
      Graph stores are becoming increasingly popular among NOSQL applications seeking flexibility and heterogeneity in managing linked data. Conceptually and in practice, applications ranging from social networks, knowledge ...
    • Multi-resolution social network community identification and maintenance on big data platform 

      Aksu, Hidayet; Canım, M.; Chang, Y.-C.; Körpeoğlu, İbrahim; Ulusoy, Özgür (IEEE, 2013-06-07)
      Community identification in social networks is of great interest and with dynamic changes to its graph representation and content, the incremental maintenance of community poses significant challenges in computation. ...
    • The parallel surrogate constraint approach to the linear feasibility problem 

      Özaktaş H.; Akgül, M.; Pınar, M.Ç. (Springer Verlag, 1996)
      The linear feasibility problem arises in several areas of applied mathematics and medical science, in several forms of image reconstruction problems. The surrogate constraint algorithm of Yang and Murty for the linear ...
    • Safe data parallelism for general streaming 

      Schneider S.; Hirzel M.; Gedik, B.; Wu, Kun-Lung (Institute of Electrical and Electronics Engineers, 2015)
      Streaming applications process possibly infinite streams of data and often have both high throughput and low latency requirements. They are comprised of operator graphs that produce and consume data tuples. General streaming ...