Όλο το DSpace

Πλοήγηση ανά Θέμα "Systems"

Αποτελέσματα 1-20 από 36

    • CDNs Content Outsourcing via Generalized Communities 

      Katsaros, D.; Pallis, G.; Stamos, K.; Vakali, A.; Sidiropoulos, A.; Manolopoulos, Y. (2009)
      Content distribution networks (CDNs) balance costs and quality in services related to content delivery. Devising an efficient content outsourcing policy is crucial since, based on such policies, CDN providers can provide ...

    • Challenges in Demand Load Control for the Smart Grid 

      Koutsopoulos, I.; Tassiulas, L. (2011)
      The ground to address challenges in demand load control for the smart power grid is now more fertile than ever, due to advances in communication infrastructures and the creation of a two-way channel for real-time communication ...

    • Client-server games and their equilibria in peer-to-peer networks 

      Koutsopoulos, I.; Tassiulas, L.; Gkatzikis, L. (2014)
      In peer-to-peer networks, each peer acts simultaneously as client and server, by issuing and satisfying content requests respectively. In this work, we use concepts from non-cooperative game theory to model the interaction ...

    • Cloud Computing 

      Katsaros, D.; Pallis, G.; Sivasubramanian, S.; Vakali, A. (2011)

    • Connectivity Issues for Ultraviolet UV-C Networks 

      Vavoulas, A.; Sandalidis, H. G.; Varoutas, D. (2011)
      This paper focuses on the connectivity issues of a non-line-of-sight (NLOS) optical wireless network operating in the ultraviolet UV-C spectral region. NLOS UV-C transmitters have a limited effective coverage and, hence, ...

    • A content-based publish/subscribe framework for large-scale content delivery 

      Diallo, M.; Sourlas, V.; Flegkas, P.; Fdida, S.; Tassiulas, L. (2013)
      The publish/subscribe communication paradigm has become an important architectural style for designing distributed systems and has recently been considered one of the most promising future network architectures that solves ...

    • Cooperative caching in wireless multimedia sensor networks 

      Dimokas, N.; Katsaros, D.; Manolopoulos, Y. (2008)
      The recent advances in miniaturization and the creation of low-power circuits, combined with small-sized batteries have made the development of wireless sensor networks a working reality. Lately, the production of cheap ...

    • Distributed Online Algorithms for the Agent Migration Problem in WSNs 

      Tziritas, N.; Lalis, S.; Khan, S. U.; Loukopoulos, T.; Xu, C. Z.; Lampsas, P. (2013)
      The mobile agent paradigm has been adopted by several systems in the area of wireless sensor networks as it enables a flexible distribution and placement of application components on nodes, at runtime. Most agent placement ...

    • Duplicate record detection: A survey 

      Elmagarmid, A. K.; Ipeirotis, P. G.; Verykios, V. S. (2007)
      Often, in the real world, entities have two or more representations in databases. Duplicate records do not share a common key and/or they contain errors that make duplicate matching a difficult task. Errors are introduced ...

    • Dynamic radio resource and interference management for MIMO-OFDMA mobile broadband wireless access systems 

      Papathanasiou, C.; Dimitriou, N.; Tassiulas, L. (2013)
      A multi-user multi-cell Multiple-Input Multiple Output/Orthogonal Frequency Division Multiple Access (MIMO/OFDMA) system for next generation Broadband Wireless Access (BWA) networks is studied, in which the Base Station ...

    • Enhancing wireless networks with caching: Asymptotic laws, sustainability & trade-offs 

      Gitzenis, S.; Paschos, G. S.; Tassiulas, L. (2014)
      We investigate on the sustainability of multihop wireless communications in the context of Information-Centric Networks, when content is replicated in caches over the network. The problem is cast in a flat wireless network ...

    • Exact Knowledge Hiding through Database Extension 

      Gkoulalas-Divanis, A.; Verykios, V. S. (2009)
      In this paper, we propose a novel, exact border-based approach that provides an optimal solution for the hiding of sensitive frequent item sets by 1) minimally extending the original database by a synthetically generated ...

    • Experimentation on end-to-end performance aware algorithms Cross Mark in the federated environment of the heterogeneous PlanetLab and NITOS testbeds 

      Keranidis, S.; Giatsios, D.; Korakis, T.; Koutsopoulos, I.; Tassiulas, L.; Rakotoarivelo, T.; Ott, M.; Parmentelat, T. (2014)
      The constantly increasing diversity of the infrastructure used to deliver Internet services to the end user has created a demand for experimental network facilities featuring heterogeneous resources. Therefore, federation ...

    • Hardware support for multithreaded execution of loops with limited parallelism 

      Dimitriou, G.; Polychronopoulos, C. (2005)
      Loop scheduling has significant differences in multithreaded from other parallel processors. The sharing of hardware resources imposes new scheduling limitations, but it also allows a faster communication across threads. ...

    • Hiding sensitive knowledge without side effects 

      Gkoulalas-Divanis, A.; Verykios, V. S. (2009)
      Sensitive knowledge hiding in large transactional databases is one of the major goals of privacy preserving data mining. However, it is only recently that researchers were able to identify exact solutions for the hiding ...

    • A knowledge management architecture for 3D shapes and applications 

      Pitikakis, M.; Houstis, C.; Vasilakis, G.; Vavalis, M. (2005)
      In this paper, we present a knowledge-based approach to 3D shape management and service composition, exploiting and extending Web Services and Semantic Web technologies. Semantic Web technology fosters semantic interoperability, ...

    • A low-power VLSI architecture for intra prediction in H.264 

      Stamoulis, G.; Koziri, M.; Katsavounidis, I.; Bellas, N. (2005)
      The H.264 video coding standard can achieve considerably higher coding efficiency than previous standards. The key to this high code efficiency are mainly the Intra and Inter prediction modes provided by the standard. ...

    • LR-tree: A logarithmic decomposable spatial index method 

      Bozanis, P.; Nanopoulos, A.; Manolopoulos, Y. (2003)
      Since its introduction in 1984, R-tree has been proven to be one of the most practical and well-behaved data structures for accommodating dynamic massive sets of geometric objects and conducting a very diverse set of queries ...

    • Managing the Future Internet through Intelligent In-Network Substrates 

      Charalambides, M.; Pavlou, G.; Flegkas, P.; Wang, N.; Tuncer, D. (2011)
      The current Internet has been founded on the architectural premise of a simple network service used to interconnect relatively intelligent end systems. While this simplicity allowed it to reach an impressive scale, the ...

    • A MaxMin approach for hiding frequent itemsets 

      Moustakides, G. V.; Verykios, V. S. (2008)
      In this paper, we are proposing a new algorithmic approach for sanitizing raw data from sensitive knowledge in the context of mining of association rules. The new approach (a) relies on the maxmin criterion which is a ...