Results 241 to 250 of about 2,087,550 (284)
Block cipher construction using minimum spanning tree from graph theory and its application with image encryption. [PDF]
Rasheed MW+3 more
europepmc +1 more source
A Local Adversarial Attack with a Maximum Aggregated Region Sparseness Strategy for 3D Objects. [PDF]
Zhao L+7 more
europepmc +1 more source
Machine learning analysis of a large set of homopolymers to predict glass transition temperatures. [PDF]
Casanola-Martin GM+5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the 9th annual conference on Genetic and evolutionary computation, 2007
We propose and analyze a novel genotype to represent walk and cycle covers in graphs, namely matchings in the adjacency lists. This representation admits the natural mutation operator of adding a random match and possibly also matching the former partners.To demonstrate the strength of this set-up, we use it to build a simple (1+1) evolutionary ...
Daniel Johannsen, Benjamin Doerr
openaire +3 more sources
We propose and analyze a novel genotype to represent walk and cycle covers in graphs, namely matchings in the adjacency lists. This representation admits the natural mutation operator of adding a random match and possibly also matching the former partners.To demonstrate the strength of this set-up, we use it to build a simple (1+1) evolutionary ...
Daniel Johannsen, Benjamin Doerr
openaire +3 more sources
Acceleration of Packet Classification Using Adjacency List of Rules
2019 28th International Conference on Computer Communication and Networks (ICCCN), 2019Packet classification is used to determine the behavior of packets incoming to network devices. Since it is achieved using linear search on a classification rule list, a large number of rules leads to longer communication latency. To decrease this latency, the problem is generalized as optimal rule ordering (ORO), which aims to identify the order of ...
Ken Tanaka+3 more
openaire +3 more sources
The Complexity of Counting Cycles in the Adjacency List Streaming Model
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019We study the problem of counting cycles in the adjacency list streaming model, fully resolving in which settings there exist sublinear space algorithms. Our main upper bound is a two-pass algorithm for estimating triangles that uses $\wtO (m/T^2/3 )$ space, where m is the edge count and T is the triangle count of the graph.
Eric Price+3 more
openaire +3 more sources
Adjoin: A causal consistency model based on the adjacency list in a distributed system
Concurrency and Computation: Practice and Experience, 2020SummaryData consistency is a critical topic in distributed systems. In existing consistency models, causal consistency has attracted a significant amount of attention because it can satisfy high‐performance requirements even in the presence of network partitions.
Yanan Pang, Junfeng Tian
openaire +3 more sources
Stack Implementation of Adjacency List for Representation of Graphs
Confluence 2013: The Next Generation Information Technology Summit (4th International Conference), 2013Graph theory has played a vital role in implementation of many mathematical and computer applications [8]. The immensely critical role of graph theory calls for an efficient methodology of representing the graphs. In this paper we explore an approach to represent the graphs [1] through adjacency lists using stacks instead of the conventional methods ...
Aruna Bhat, Rajni Jindal, Anshu Yadav
openaire +3 more sources
Simplify Test Requirement Suite Automatically by Adjacency List
2009 Asia-Pacific Conference on Information Processing, 2009Simplifying test requirement suite is helpful for optimizing test case suite, as is proposed in this paper, it bases on adjacency list. Primarily, confirmed the test requirements and generated the initial test case suite according to program flow diagram, then drew the directed graph of relationships of test requirements and its corresponding adjacency
Jianyuan Su+6 more
openaire +3 more sources