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.
Filters
Searching for a Single Community in a Graph
[article]
2018
arXiv
pre-print
Preserved Fulltext
In contrast, the "search" problem of this paper aims to only find the nodes in a "single" such community, the target, out of the many communities that may exist. ...
In standard graph clustering/community detection, one is interested in partitioning the graph into more densely connected subsets of nodes. ...
Related work While no other work has considered the problem of searching a single community in a graph, there has been a lot of research in three closely related fields; that of unsupervised and semi-supervised ...
arXiv:1806.07944v1
fatcat:nefvsmt3zvbqtm7mfn7addyxjy
Algorithms to Calculate the Most Reliable Maximum Flow in Content Delivery Network
2022
Computer systems science and 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 2022; you can also visit the original URL.
The file type is application/pdf.
Calculating the most reliable maximum flow (MRMF) from the edge cache node to the requesting node can provide an important reference for selecting the best edge cache node in a content delivery network ...
This algorithm continuously deletes the negative weight communities, which can increase reliability while keeping the flow constant in the residual graph. ...
Acknowledgement: The authors would like to thank the Editor and anonymous reviewers for their valuable comments that significantly improved the manuscript. ...
doi:10.32604/csse.2022.020193
fatcat:s44u6nhz5bghvjd4vi7zjbbb4a
The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree
2016
Journal of Graph Algorithms and 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 2019; you can also visit the original URL.
The file type is application/pdf.
This paper introduces the problem of communication pattern adaption for a distributed self-adjusting binary search tree. ...
However, for the other conflict classes, a distributed self-adjusting binary search tree adapts poorly. ...
Acknowledgements: The author thanks Alexander Skopalik for stimulating discussions that improved the quality of the paper, and Christian Scheideler for his scientific guidance. ...
doi:10.7155/jgaa.00385
fatcat:mojvjeyzpndhvbncnqk6aogqbe
Integrated Task Clustering, Mapping and Scheduling for Heterogeneous Computing Systems
2012
International Journal of Computer Science & Information Technology (IJCSIT)
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.
This paper presents a new approach for mapping and scheduling task graphs for heterogeneous hardware/software computing systems using heuristic search. ...
Experimental results show that our proposed approach outperforms a separate approach in terms of speedup by up to 18.3% for a system with a microprocessor, a floating-point digital signal processor, and ...
Acknowledgement The support of Macao Science and Technology Development Fund (Grant No. 058/2010/A) is gratefully acknowledged. ...
doi:10.5121/ijcsit.2012.4111
fatcat:6mchken4rrcjni2z7ziuhdvvbm
Parallel Model Checking Using Abstraction
[chapter]
2012
Lecture Notes in 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 2014; you can also visit the original URL.
The file type is application/pdf.
In this work, we compare hash-distributed search, a well-known parallel search technique for model checking, with an algorithm from the automated planning and heuristic search community called Parallel ...
Many model checking techniques are based on enumerative graph search, a procedure that is known to be prohibitively time and memory consuming. ...
In the absence of communication, the only time either algorithm will converge (i.e., declare the model is bug-free) is if a single thread exhausts the entire search space -a rarity for large verification ...
doi:10.1007/978-3-642-31759-0_13
fatcat:mp6cas7mfravlkrnzfcxfrntpy
Information Theoretic Criteria for Community Detection
[chapter]
2010
Lecture Notes in 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 2017; you can also visit the original URL.
The file type is application/pdf.
Many algorithms for finding community structure in graphs search for a partition that maximizes modularity. ...
Membership in such communities is better modeled as attributes of vertices rather than through a partition of the graph [3] . ...
The MITRE Corporation is a nonprofit Federally Funded Research and Development Center chartered in the public interest. ...
doi:10.1007/978-3-642-14929-0_7
fatcat:npahsolc4fdonl6xgoagvwyz3u
Xander: employing a novel method for efficient gene-targeted metagenomic assembly
2015
Microbiome
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.
This method combines a de Bruijn graph, as used in standard assembly approaches, and a protein profile hidden Markov model (HMM) for the gene of interest, as used in standard annotation approaches. ...
These are used to create a novel combined weighted assembly graph. Xander performs both assembly and annotation concomitantly using information incorporated in this graph. ...
Acknowledgements We thank Jiarong Guo for providing his unpublished bulk assembly data. ...
doi:10.1186/s40168-015-0093-6
pmid:26246894
pmcid:PMC4526283
fatcat:6dnt4fn2hzgi5mae5vh2reb2vm
Detecting Statistically Significant Communities
[article]
2019
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 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The configuration model is a widely used random graph model in community detection, in which the degree of each node is preserved in the generated random networks. ...
Meanwhile, we present a local search method to detect statistically significant communities in an iterative manner. ...
Given a seed set ns, Search One Community(ns) returns a single statistically significant community using a local search procedure in Algorithm 2. ...
arXiv:1806.05602v2
fatcat:35jnxpzzwjamtce6ern4h53rky
Evaluating Algorithms for Composable Service Placement in Computer Networks
2009
2009 IEEE International Conference on Communications
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.
A major operational challenge in such systems is to determine where to perform the required services along the data path. ...
In this paper, we present an evaluation of several existing and newly developed heuristic algorithms for solving the problem. ...
We assume that cost for communication and cost for service processing can be represented using a single metric (e.g., delay). ...
doi:10.1109/icc.2009.5199007
dblp:conf/icc/HuangGW09
fatcat:25wflilskzdftbwf2wp4bmar5q
Demo: A Proof-of-Concept Implementation of Guard Secure Routing Protocol
[article]
2020
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 2020; you can also visit the original URL.
The file type is application/pdf.
Guard is the first authenticated search mechanism for Skip Graphs, enables reliable search operation in a fully decentralized manner. ...
In a Skip Graph overlay, any misbehavior of peers during the routing of a query compromises the system functionality. ...
There exists only a single instance of a CONTROLLER node for a simulation of Guard. CONTROLLER acts as a centralized point of trust that synchronizes the overlay nodes with each other. ...
arXiv:2007.13212v1
fatcat:nmvhmolimnebvktoi5gbbxi374
A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion
1985
IEEE transactions on computers
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.
A cost function defined in terms of a single unit, time, is proposed for evaluating the effectiveness of task assignment. ...
A graph matching approach is proposed in this paper for solving the task assignment problem encountered in distributed computing systems. ...
For a task assignment A to be acceptable, any two modules a and b which communicate with each other must be assigned either to a single processor X or to two processors X and Y with a communication link ...
doi:10.1109/tc.1985.1676563
fatcat:yv33nveorreahpumanawbn2b6q
The Community Structure of Constraint Satisfaction Problems and Its Correlation with Search Time
2020
2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI)
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 2022; you can also visit the original URL.
The file type is application/pdf.
This paper explores the community structure of constraint satisfaction problems, a type of structure already found to be important for SAT problems that is inherent to certain real-world domains. ...
The results reveal the strong community structure of many of the instances, although the strength of the community structure seems to only marginally affect the search times. ...
This representation does not retain all information about the problem, as a clique in the graph can, for example, correspond to both a single constraint scope or multiple overlapping constraint scopes. ...
doi:10.1109/ictai50040.2020.00034
fatcat:p3nrm767lre73ii74leurb6li4
Search and pursuit-evasion in mobile robotics
2011
Autonomous Robots
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.
In addition, we highlight current open problems in the area and explore avenues for future work. ...
We then list a number of fundamental results in the areas of pursuit-evasion and probabilistic search, and we discuss field implementations on mobile robotic systems. ...
Order of Play: Imagine a game between a single cop and the robber on a complete graph K n . If the players move in turns, the cop can capture the robber in a single move. ...
doi:10.1007/s10514-011-9241-4
fatcat:i7re3nuyg5fxxfcysmh6imvo7q
The Advantages of Multiple Parallelizations in Combinatorial Search
1994
Journal of Parallel and Distributed Computing
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.
ACKNOWLEDGMENTS We thank Argonne National Laboratories for the use of their TC2000, International Business Machines for providing the 8CE, Donna Bergmark and the Cornell Theory Center for their assistance ...
and the use of their KSR 1, and Sequent Computer Systems for providing the Balance and Symmetry. ...
The search for isomorphisms takes the form of a tree, where nodes at level i correspond to a single postulated mapping for vertices 1 through i in the small graph and a set of possible mappings for each ...
doi:10.1006/jpdc.1994.1045
fatcat:tibn2jnu5zcidkzko7p2fmkrti
Creating and Exploiting the Intrinsically Disordered Protein Knowledge Graph (IDP-KG)
2022
Workshop on Semantic Web Applications and Tools for Life Sciences
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 2022; you can also visit the original URL.
The file type is application/pdf.
content by querying them as a single, consolidated knowledge graph. ...
Bioschemas markup is a machine-readable, lightweight representation of the content of each page in the site that is embedded in the HTML. For any site it is accessible through a HTTP request. ...
Early stages of this work were carried out during the BioHackathon Europe 2020 organized by ELIXIR in November 2020. ...
dblp:conf/swat4ls/GrayPAMH22
fatcat:4drvy5pfdzdgpbl7ew2fiu24qa
« Previous
Showing results 1 — 15 out of 330,285 results