A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Quick Detection of Nodes with Large Degrees
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
Our goal is to quickly find top k lists of nodes with the largest degrees in large complex networks. ...
We show theoretically and by numerical experiments that for large networks the random walk method finds good quality top lists of nodes with high probability and with computational savings of orders of ...
Random walk with uniform jumps Let us consider a random walk with uniform jumps which serves as a basic algorithm for quick detection of large degree nodes. ...
doi:10.1007/978-3-642-30541-2_5
fatcat:db54irm4c5chnmodbqe5kdqmyq
Quick Detection of Nodes with Large Degrees
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Our goal is to quickly find top k lists of nodes with the largest degrees in large complex networks. ...
We show theoretically and by numerical experiments that for large networks the random walk method finds good quality top lists of nodes with high probability and with computational savings of orders of ...
Random walk with uniform jumps Let us consider a random walk with uniform jumps which serves as a basic algorithm for quick detection of large degree nodes. ...
arXiv:1202.3261v1
fatcat:kinbbvvowzchhcaninjfyr5hiy
Quick Detection of Nodes with Large Degrees
2014
Internet Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Our goal is to find top-k lists of nodes with the largest degrees in large complex networks quickly. ...
We show theoretically and by numerical experiments that for large networks, the random-walk method finds good-quality top lists of nodes with high probability and with computational savings of orders of ...
We would like to thank Ali Eshragh for helpful remarks that we received during the preparation of the manuscript. ...
doi:10.1080/15427951.2013.798601
fatcat:v3pmetdn6jbptoe4o4iuycf4ia
A Fast Method of Detecting Overlapping Community in Network Based on LFM
2015
Journal of Software
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Aiming at the high complexity of expanding strategy and the defect of generating many homeless nodes in LFM, we propose a quick algorithm based on local optimization of a fitness function(QLFM). ...
The proposed algorithm firstly select a node as seed randomly .With a local fitness function ,the algorithm then will expand from inside to outside of the seed according to the Breadth-First-Search in ...
The external degree is the number of links joining each member of the module with the rest of the graph .for any node ,we define its fitness function as a variation of the fitness of sub-graph with ({ ...
doi:10.17706//jsw.10.7.825-834
fatcat:fr6sfbl6bzb2nc7xiv27q5jvbi
A Fast Method of Detecting Overlapping Community in Network Based on LFM
2015
Journal of Software
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Aiming at the high complexity of expanding strategy and the defect of generating many homeless nodes in LFM, we propose a quick algorithm based on local optimization of a fitness function(QLFM). ...
The proposed algorithm firstly select a node as seed randomly .With a local fitness function ,the algorithm then will expand from inside to outside of the seed according to the Breadth-First-Search in ...
The external degree is the number of links joining each member of the module with the rest of the graph .for any node ,we define its fitness function as a variation of the fitness of sub-graph with ({ ...
doi:10.17706/jsw.10.7.825-834
fatcat:7m2ir25otnfqdpu7dlfjnyv2gq
Accelerating Iterative Detection for Spatially Coupled Systems by Collaborative Training
2013
IEEE Communications Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2012 pre-print arXiv:1210.6168v1 fatcat:44pc5lx3hzebjppdcztbak7eeyOther Versions
As an example of SC systems, SC code-division multiple-access (CDMA) systems are considered. ...
This letter proposes a novel method for accelerating iterative detection for spatially coupled (SC) systems. ...
Takeuchi is with the Department of Communication Engineering and Informatics, the University of Electro-Communications, Tokyo 182-8585, Japan (e-mail: ktakeuchi@uec.ac.jp). ...
doi:10.1109/lcomm.2013.012213.122769
fatcat:s2hnmxmgpnhclo4s5lw4dbgvxi
Quick Detection of High-degree Entities in Large Directed Networks
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this paper, we address the problem of quick detection of high-degree entities in large online social networks. ...
Practical importance of this problem is attested by a large number of companies that continuously collect and update statistics about popular entities, usually using the degree of an entity as an approximation ...
INTRODUCTION In this paper we propose a randomized algorithm for quick detection of high-degree entities in large online social networks. ...
arXiv:1410.0571v2
fatcat:vs3jykr7dnc3rocujon5dfpapa
Some Aspects of Coverage Awareness in Wireless Sensor Networks
2015
Procedia Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Wireless sensor network (WSN) consists of network of wireless nodes that have the capability of computation, communication and sense a parameter of interest. ...
So, this paper provided the brief and quick understanding of the coverage issues and metrics against coverage in wireless sensor networks. ...
A node is connected directly with number of nodes is termed as node degree, that is d(v). The node is called isolated node if it has no neighbor nodes, means d(v)=0. ...
doi:10.1016/j.procs.2015.10.065
fatcat:cbug3df7cnb5ji6na6w7hfzf54
Evaluating community structure in large network with random walks
[article]
2013
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
In fact there are lots of networks with millons even billons of nodes. In such case, most algorithms running in time O(n2logn) or even larger are not practical. ...
Our algorithm are effective in small benchmark networks with small less accuracy than more complex algorithms but a great of advantage in time consuming for large networks, especially super large networks ...
All of these algorithm scale O(n 2 logn) or higher, and are not practical in super large networks with millons and billons of nodes. ...
arXiv:1301.2698v1
fatcat:n62nuko2nnghviuiwgm76odi4y
EFFICIENT PROBE STATION PLACEMENT AND PROBE SET SELECTION FOR FAULT LOCALIZATION
2012
International Journal of Communication Networks and Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Since faults are unavoidable in communication systems, their quick detection and isolation is essential for the robustness, reliability, and accessibility of a system. ...
Network fault management has been a focus of research activity with more emphasis on fault localization – zero down exact source of a failure from set of observed failures. ...
Selecting highest degree node as first probe station can remove large number of nodes from uncovered node set. ...
doi:10.47893/ijcns.2012.1050
fatcat:g5f5qrejpbdyjbuaw3oesyh3ea
Assessment of Overlap of Phylogenetic Transmission Clusters and Communities in Simple Sexual Contact Networks: Applications to HIV-1
2016
PLoS ONE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We simulate a large number of epidemics over both unweighted and weighted, undirected random interconnected-islands networks, with islands corresponding to communities. ...
In particular, phylogenetic analyses of HIV-1 epidemics among men who have sex with men (MSM) have revealed the existence of large transmission clusters, possibly resulting from within-community transmissions ...
Connected nodes are called neighbours. The number of neighbours for a given node is called its degree, and the degree distribution is one of the defining features of contact network graphs. ...
doi:10.1371/journal.pone.0148459
pmid:26863322
pmcid:PMC4749335
fatcat:tgg7jrdizfakdeimhyoudj2vfq
Plagiarism Detection Using Graph-Based Representation
[article]
2010
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The main advantage of the proposed method is the topic signature which is main entry for the graph is used as quick guide to the relevant nodes. which should be considered for the comparison between source ...
Topic signature node is formed by extracting the concepts of each sentence terms and grouping them in such node. ...
To calculate the degree of similarity of the node with other nodes using the following equations Where is a sentence I, C si is a number of concepts in the sentence I, C sk is a number of concepts in each ...
arXiv:1004.4449v1
fatcat:kbha6voi4fa23cawgqog7mlqoq
Community Detection in Complex Network via BGLL Algorithm
2012
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
structure of large complex systems that comprise of millions of nodes. ...
Various methods proposed so far are not efficient and accurate for large networks which comprise of millions of nodes because of their high computational cost. ...
Al and Newman et al. for their work as it provides us the good understanding of the community detection concept. ...
doi:10.5120/7315-9916
fatcat:cakuc3asnfcjhgh3k7wdxvvdla
The New Multipoint Relays Selection in OLSR using Particle Swarm Optimization
2012
TELKOMNIKA Indonesian Journal of Electrical Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The new fitness function of PSOSIIW, packet delay of each node and degree of willingness are introduced to support MPRs selection in OLSR. ...
The sigmoid increasing inertia weight has significance improve the particle swarm optimization (PSO) in terms of simplicity and quick convergence towards optimum solution. ...
Acknowledgement The work was supported by Research and Management Centre Universiti Teknologi Malaysia and the Ministry of Higher Education of Malaysia under FRGS Grant Vot. No. 78369. ...
doi:10.11591/telkomnika.v10i2.688
fatcat:w3gbhy6sv5dubovt6uoxi7d2u4
The New Multipoint Relays Selection in OLSR using Particle Swarm Optimization
2012
TELKOMNIKA (Telecommunication Computing Electronics and Control)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The new fitness function of PSOSIIW, packet delay of each node and degree of willingness are introduced to support MPRs selection in OLSR. ...
The sigmoid increasing inertia weight has significance improve the particle swarm optimization (PSO) in terms of simplicity and quick convergence towards optimum solution. ...
Acknowledgement The work was supported by Research and Management Centre Universiti Teknologi Malaysia and the Ministry of Higher Education of Malaysia under FRGS Grant Vot. No. 78369. ...
doi:10.12928/telkomnika.v10i2.10
fatcat:l355bkfomrhxfdp3knzqdvsdum
« Previous
Showing results 1 — 15 out of 53,754 results