Filters








8,552 Hits in 4.4 sec

Engineering Parallel Algorithms for Community Detection in Massive Networks

Christian L. Staudt, Henning Meyerhenke
<span title="2016-01-01">2016</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ll6bfs5o6bahfinh3u5z2cnyoy" style="color: black;">IEEE Transactions on Parallel and Distributed Systems</a> </i> &nbsp;
One common graph analytics kernel is disjoint community detection (or graph clustering).  ...  Our methods are suitable for massive data sets with billions of edges.  ...  Accordingly, our objective is the development and imple-mentation of parallel community detection heuristics which are able to handle massive graphs quickly while also producing a high-quality solution  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tpds.2015.2390633">doi:10.1109/tpds.2015.2390633</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/b24piu4j2fc7bk4hknq4wo4lny">fatcat:b24piu4j2fc7bk4hknq4wo4lny</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811011203/http://parco.iti.kit.edu/staudt/attachments/publications/TPDS.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a0/cf/a0cfac59affac38968f2fa653dadf40205a3af25.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tpds.2015.2390633"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Problem Domains in Complex Networks

Mini Singh Ahuja
<span title="">2016</span> <i title="IOSR Journals"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vabuspdninc75epczdurccts4u" style="color: black;">IOSR Journal of Computer Engineering</a> </i> &nbsp;
In this paper most important research domains related to complex networks are reviewed such as Community detection, Influence Maximization, network sampling etc.  ...  This paper will help in selecting the research problem in field of complex networks for the researchers who are new to this field.  ...  On the other hand approximation algorithms guarantee performance but with a factor of optimum value. Dealing with massive data Complex networks are massive in size.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.9790/0661-1805026568">doi:10.9790/0661-1805026568</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nxcrszgskjbkfmgzel4ml5a4sq">fatcat:nxcrszgskjbkfmgzel4ml5a4sq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180602083934/http://www.iosrjournals.org/iosr-jce/papers/Vol18-issue5/Version-2/L1805026568.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7a/9f/7a9ffe1baeb375cfbf0257c8e0dba08b0d227a97.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.9790/0661-1805026568"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Algorithm Engineering (Dagstuhl Seminar 13391)

Andrew V. Goldberg, Giuseppe F. Italiano, David S. Johnson, Dorothea Wagner, Marc Herbstritt
<span title="2014-01-17">2014</span> <i title="Schloss Dagstuhl Leibniz-Zentrum für Informatik GmbH"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/u2phfyhrhje7xnnubtp3vfklcu" style="color: black;">Dagstuhl Reports</a> </i> &nbsp;
Algorithm engineering touches other research areas such as algorithm theory, combinatorial optimization, computer architecture, parallel and distributed computing, high-performance computing, and operations  ...  planning, as well as graph partitioning and the computation of Steiner trees.  ...  -Algorithm Engineering the work of the aggregate operator's processing steps. We provide an extensive study of the properties of the proposed aggregate operators and the new data structures.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/dagrep.3.9.169">doi:10.4230/dagrep.3.9.169</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/journals/dagstuhl-reports/GoldbergIJW13.html">dblp:journals/dagstuhl-reports/GoldbergIJW13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n75s6d7obngxbitr4rcxxadmxq">fatcat:n75s6d7obngxbitr4rcxxadmxq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220123034347/https://drops.dagstuhl.de/opus/volltexte/2014/4421/pdf/dagrep_v003_i009_p169_s13391.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a4/8e/a48e97c47d42774beba39d999373a721b265d738.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/dagrep.3.9.169"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks

David A. Bader, Kamesh Madduri
<span title="">2008</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5vsih2yegrfubf7el6ncng3mgq" style="color: black;">Proceedings, International Parallel and Distributed Processing Symposium (IPDPS)</a> </i> &nbsp;
To illustrate the capability of SNAP, we discuss the design, implementation, and performance of three novel parallel community detection algorithms that optimize modularity, a popular measure for clustering  ...  We conduct an extensive experimental study on real-world graph instances and demonstrate that our parallel schemes, coupled with aggressive algorithm engineering for smallworld networks, give significant  ...  We thank Nicolas Bitouze (ENS Cachan) for implementing the parallel greedy agglomeration algorithm, and Jon Berry and Bruce Hendrickson (Sandia National Laboratories) for discussions on large-scale graph  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ipdps.2008.4536261">doi:10.1109/ipdps.2008.4536261</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ipps/BaderM08.html">dblp:conf/ipps/BaderM08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gceim62ogjdybe4nfyx224t4wa">fatcat:gceim62ogjdybe4nfyx224t4wa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170812004118/https://www.cc.gatech.edu/fac/bader/papers/SNAP-IPDPS2008.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7e/5e/7e5e78dae85efdf7d405d3bc693fd0b1560c0030.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ipdps.2008.4536261"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

NetworKit: A Tool Suite for Large-scale Complex Network Analysis [article]

Christian L. Staudt, Aleksejs Sazonovs, Henning Meyerhenke
<span title="2015-11-13">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Our goal for the software is to package results of our algorithm engineering efforts and put them into the hands of domain experts.  ...  We describe the methodology applied to develop scalable solutions to network analysis problems, including techniques like parallelization, heuristics for computationally expensive problems, efficient data  ...  , Research and the Arts Baden-Württemberg and by DFG grant ME-3619/3-1 (FINCA) within the SPP 1736 Algorithms for Big Data.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1403.3005v3">arXiv:1403.3005v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5kg5gfcm4jgj3mpghtl3cssoda">fatcat:5kg5gfcm4jgj3mpghtl3cssoda</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826094312/https://arxiv.org/pdf/1403.3005v3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b1/d5/b1d535205156ed9a0479d12f32a602a5bbd04fa9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1403.3005v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Guest Editorial: IEEE TC Special Issue On Communications for Many-core Processors and Accelerators

Zhonghai Lu
<span title="2021-06-01">2021</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5jlmyrayyrdazh5awdlsoec77q" style="color: black;">IEEE transactions on computers</a> </i> &nbsp;
Another 58 reviews were performed in the second round to evaluate the revised submissions. Eventually, 10 high quality manuscripts have been selected for this special issue.  ...  The article "HAM: Hotspot-Aware Manager for Improving Communications With 3D-Stacked Memory" by Wang et al. proposes a Hotspot-Aware Manager (HAM) design for 3D-stacked memory devices.  ...  The article "Efficient Pipelined Execution of CNNs Based on In-Memory Computing and Graph Homomorphism Verification" by Dazzi et al. presents an efficient communication fabric for in-memory computing cores  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tc.2021.3068060">doi:10.1109/tc.2021.3068060</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pcxs27wbr5h3riejjuzfgdtbqm">fatcat:pcxs27wbr5h3riejjuzfgdtbqm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210601201000/https://ieeexplore.ieee.org/ielx7/12/9437243/09437248.pdf?tp=&amp;arnumber=9437248&amp;isnumber=9437243&amp;ref=" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/da/da/dada0f7134386bb3a60b8fab9cb53321a6f0fd4a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tc.2021.3068060"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

NetworKit: A tool suite for large-scale complex network analysis

CHRISTIAN L. STAUDT, ALEKSEJS SAZONOVS, HENNING MEYERHENKE
<span title="">2016</span> <i title="Cambridge University Press (CUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vlvhfnkg55dizia4sebehhpaqa" style="color: black;">Network Science</a> </i> &nbsp;
Our goal for the software is to package results of our algorithm engineering efforts and put them into the hands of domain experts.  ...  We describe the methodology applied to develop scalable solutions to network analysis problems, including techniques like parallelization, heuristics for computationally expensive problems, efficient data  ...  Acknowledgments This work was partially supported by the project Parallel Analysis of Dynamic Networks-Algorithm Engineering of Efficient Combinatorial and Numerical Methods, which is funded by the Ministry  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/nws.2016.20">doi:10.1017/nws.2016.20</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/46nozmdun5b3pd4p3ruf74lveq">fatcat:46nozmdun5b3pd4p3ruf74lveq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190501165738/https://www.cambridge.org/core/services/aop-cambridge-core/content/view/03DB673D73EDC84C0A143864FFA17831/S2050124216000205a.pdf/div-class-title-networkit-a-tool-suite-for-large-scale-complex-network-analysis-div.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0d/0a/0d0a23a27fe160f9829a4dc895ec2dbb92b1d49d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/nws.2016.20"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> cambridge.org </button> </a>

RETRACTED: Crowd Sensing Based Burst Computing of Events Using Social Media

Zheng Xu, Yunhuai Liu, Lin Mei, Hui Zhang, Chuanping Hu
<span title="">2015</span> <i title="SAGE Publications"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/snvb3djywzbhvjtue42hxtjery" style="color: black;">International Journal of Distributed Sensor Networks</a> </i> &nbsp;
The evaluations on real dataset show that the proposed function integrating the number of web pages and the average clustering coefficient can be used for event detection efficiently and correctly.  ...  Different temporal features of web events are developed to provide the basics for the proposed computation algorithm.  ...  The set of communities is a segmentation of the context graph. Each context community is a part of the context graph, which is with no common keywords of other community.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2015/184751">doi:10.1155/2015/184751</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4h7cr3gte5dpjdsz6eua3s22ce">fatcat:4h7cr3gte5dpjdsz6eua3s22ce</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170821065456/http://downloads.hindawi.com/journals/ijdsn/2015/184751.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/10/0e/100e817f297524223f52f7a2b9942e7403aff673.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2015/184751"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a>

Discovery of ads web hosts through traffic data analysis

V. Bacarella, F. Giannotti, M. Nanni, D. Pedreschi
<span title="">2004</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6ow5mh5y3fatregun3fk6kslmm" style="color: black;">Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery - DMKD &#39;04</a> </i> &nbsp;
One of the most actual problems on web crawling -the most expensive task of any search engine, in terms of time and bandwidth consumption -is the detection of useless segments of Internet.  ...  In this work we present a web usage statistics-based solution to the problem, aimed at automatically -and, therefore, dynamically -building blacklists of sites that the users of a monitored web-community  ...  for detecting such sites is provided.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1008694.1008707">doi:10.1145/1008694.1008707</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/dmkd/BacarellaGNP04.html">dblp:conf/dmkd/BacarellaGNP04</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4gqnp4gnv5fhxhutb4hjknulsa">fatcat:4gqnp4gnv5fhxhutb4hjknulsa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060512114201/http://ercolino.isti.cnr.it:80/mirco/papers/dmkd-04-proceedings.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b6/db/b6db94de0e238f11eeeadca70ae3eb74105fb505.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1008694.1008707"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Empirical Performace Determination on Community Detection Techniques in Social Networks

<span title="2020-02-29">2020</span> <i title="Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/h673cvfolnhl3mnbjxkhtxdtg4" style="color: black;">International Journal of Engineering and Advanced Technology</a> </i> &nbsp;
Community identification is the high common and extending field of interest in social and real-time network applications. In recent years, many community detection methods have been developed.  ...  The identified communities by all the community mining algorithms for these two data sets are described in this proposed work.  ...  Louvain Modularity Blonde and Guillaum et al [1] developed the community detection methodology to find communities on massive network graph.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.35940/ijeat.b4562.029320">doi:10.35940/ijeat.b4562.029320</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pcjmgco7n5atndtewtcsv3aziy">fatcat:pcjmgco7n5atndtewtcsv3aziy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200307200509/https://www.ijeat.org/wp-content/uploads/papers/v9i3/B4562129219.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.35940/ijeat.b4562.029320"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Heuristic Event Filtering Methodology for Interval based Temporal Semantics

V. Govindasamy, P. Thambidurai
<span title="2013-05-17">2013</span> <i title="Foundation of Computer Science"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/b637noqf3vhmhjevdfk3h5pdsu" style="color: black;">International Journal of Computer Applications</a> </i> &nbsp;
Fig. 2: High Level Conceptual Framework for Heuristic Event Filtering for Interval based Temporal Semantics Algorithm for Heuristic Event Filtering for Interval based on Temporal Semantics To implement  ...  CONCLUSION In this paper, a high level conceptual framework for heuristic event filtering for interval based temporal semantics is presented.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/11974-7836">doi:10.5120/11974-7836</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/te5ecf4dazbj5odl2sabiqguja">fatcat:te5ecf4dazbj5odl2sabiqguja</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170815065029/http://research.ijcaonline.org/volume70/number7/pxc3887836.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a5/9e/a59e4c8749edfa5b9ef7bff5ae2f3f79b7aab32f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/11974-7836"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

An energy-aware bioinformatics application for assembling short reads in high performance computing systems

Julia Warnke, Sachin Pawaskar, Hesham Ali
<span title="">2012</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hfatt7tua5aatozu2id5rdeuti" style="color: black;">2012 International Conference on High Performance Computing &amp; Simulation (HPCS)</a> </i> &nbsp;
High performance computing (HPC) has been successfully applied to major bioinformatics applications to reduce computational burden.  ...  However, a naïve approach for developing parallel bioinformatics applications may achieve a high degree of parallelism while unnecessarily expending computational resources and consuming high levels of  ...  ACKNOWLEDGMENT This project was supported by the NIH grant number P20 RR016469 from the INBRE Program of the National Center for Research Resources (NCRR).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/hpcsim.2012.6266905">doi:10.1109/hpcsim.2012.6266905</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ieeehpcs/WarnkePA12.html">dblp:conf/ieeehpcs/WarnkePA12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rlplhgxdgre6hp4vixferfxf4q">fatcat:rlplhgxdgre6hp4vixferfxf4q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200320090625/https://digitalcommons.unomaha.edu/cgi/viewcontent.cgi?referer=&amp;httpsredir=1&amp;article=1049&amp;context=compsicfacproc" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/68/70/687036f1c96d95d5972cfea071cadab8c711a940.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/hpcsim.2012.6266905"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

High-Performance Graph Algorithms (Dagstuhl Seminar 18241)

Henning Meyerhenke, Richard Peng, Ilya Safro, Michael Wagner
<span title="2018-12-19">2018</span> <i title="Schloss Dagstuhl Leibniz-Zentrum für Informatik GmbH"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/u2phfyhrhje7xnnubtp3vfklcu" style="color: black;">Dagstuhl Reports</a> </i> &nbsp;
The abstracts included in this report contain and survey recent state-of-the-art results, but also point to promising new directions for high-performance graph algorithms and their applications, both from  ...  This report documents the program and outcomes of Dagstuhl Seminar 18241 "High-performance Graph Algorithms".  ...  Massively parallel communication-free graph generators We present efficient distributed algorithms for generating massive graphs for several popular models of random graphs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/dagrep.8.6.19">doi:10.4230/dagrep.8.6.19</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/journals/dagstuhl-reports/MeyerhenkePS18.html">dblp:journals/dagstuhl-reports/MeyerhenkePS18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nbodjldinjgq7eahxl6obpaqie">fatcat:nbodjldinjgq7eahxl6obpaqie</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200529101753/https://drops.dagstuhl.de/opus/volltexte/2018/10047/pdf/dagrep_v008_i006_p019_18241.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ef/10/ef101009dc4b5396cd573f14146827c3a9a2aedb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/dagrep.8.6.19"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Survey on Botnet Detection Techniques: Classification, Methods, and Evaluation

Ying Xing, Hui Shu, Hao Zhao, Dannong Li, Li Guo, Jude Hemanth
<span title="2021-04-14">2021</span> <i title="Hindawi Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wpareqynwbgqdfodcyhh36aqaq" style="color: black;">Mathematical Problems in Engineering</a> </i> &nbsp;
Combing with expert scores and objective weights, this survey proposes quantitative evaluation and gives a visual representation for typical detection methods.  ...  It focuses on the application of advanced technologies such as deep learning, complex network, swarm intelligence, moving target defense (MTD), and software-defined network (SDN) for botnet detection.  ...  networks for community detection.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2021/6640499">doi:10.1155/2021/6640499</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hkafnnj2cnbzjdbuk6iel3b5cm">fatcat:hkafnnj2cnbzjdbuk6iel3b5cm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210422032505/https://downloads.hindawi.com/journals/mpe/2021/6640499.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d3/4c/d34cb44f5ee839b1be82fb89504f51068733274b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2021/6640499"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a>

Adaptive Antenna Subset Selection and Constellation Breakdown for Spatial Modulation

Mehdi Maleki, Hamid Reza Bahrami, Ardalan Alizadeh
<span title="">2014</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/64g2ddfw6bhmnktwtxqy44u534" style="color: black;">IEEE Communications Letters</a> </i> &nbsp;
A graph-based heuristic search algorithm is then proposed to significantly reduce the search complexity of ASS compared to the exhaustive search while maintaining the performance.  ...  The problem of antenna subset selection (ASS) and constellation breakdown (CBD) for spatial modulation (SM) is investigated.  ...  in some cases, especially in large-scale (i.e. massive) MIMO systems, can be very high.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/lcomm.2014.2336837">doi:10.1109/lcomm.2014.2336837</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jm5swmx5w5cihdidbwaaxwb4je">fatcat:jm5swmx5w5cihdidbwaaxwb4je</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829144001/http://gozips.uakron.edu/~aa148/papers/subset_letter.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3e/aa/3eaad1ac2c75bca191e5d4266ff5b1d8c5dc6c12.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/lcomm.2014.2336837"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 8,552 results