Sökning: "information partition"
Visar resultat 1 - 5 av 78 avhandlingar innehållade orden information partition.
1. Fast decision of strong bisimulation equivalence using partition refinement
Sammanfattning : .... LÄS MER
2. Partition Tolerance and Data Consistency in Structured Overlay Networks
Sammanfattning : Structured overlay networks form a major class of peer-to-peer systems, which are used to build scalable, fault-tolerant and self-managing distributed applications. This thesis presents algorithms for structured overlay networks, on the routing and data level, in the presence of network and node dynamism. LÄS MER
3. Gossip-based Algorithms for Information Dissemination and Graph Clustering
Sammanfattning : Decentralized algorithms are becoming ever more prevalent in almost all real-world applications that are either data intensive, computation intensive or both. This thesis presents a few decentralized solutions for large-scale (i) data dissemination, (ii) graph partitioning, and (iii) data disambiguation. LÄS MER
4. The combined application of bibliographic coupling and the complete link cluster method in bibliometric science mapping
Sammanfattning : This thesis connects to previous research in bibliometric science mapping and citation indexing. A method was suggested for science mapping purposes and evaluated. LÄS MER
5. Science mapping and research evaluation : a novel methodology for creating normalized citation indicators and estimating their stability
Sammanfattning : The purpose of this thesis is to contribute to the methodology at the intersection of relational and evaluative bibliometrics. Experimental investigations are presented that address the question of how we can most successfully produce estimates of the subject similarity between documents. LÄS MER