Results 341 to 350 of about 245,617 (365)
Some of the next articles are maybe not open access.
Parallel Triangle Counting and Enumeration Using Matrix Algebra
2015 IEEE International Parallel and Distributed Processing Symposium Workshop, 2015Triangle counting and enumeration are important kernels that are used to characterize graphs. They are also used to compute important statistics such as clustering coefficients.
A. Azad, A. Buluç, J. Gilbert
semanticscholar +1 more source
Efficient Enumeration of Maximal k-Plexes
SIGMOD Conference, 2015The problem of enumerating (i.e., generating) all maximal cliques in a graph has received extensive treatment, due to the plethora of applications in various areas such as data mining, bioinformatics, network analysis and community detection.
D. Berlowitz, Sara Cohen, B. Kimelfeld
semanticscholar +1 more source
2010
In Chapter 14, you saw that you can use a foreach statement to cycle through the elements of an array. In this chapter, you’ll take a closer look at arrays and see why they can be processed by foreach statements. You’ll also look at how you can add this capability to your own user-defined classes. Later in the chapter, I’ll explain the use of iterators.
openaire +2 more sources
In Chapter 14, you saw that you can use a foreach statement to cycle through the elements of an array. In this chapter, you’ll take a closer look at arrays and see why they can be processed by foreach statements. You’ll also look at how you can add this capability to your own user-defined classes. Later in the chapter, I’ll explain the use of iterators.
openaire +2 more sources
2015
This article discusses the relationship between random matrices and maps, i.e. graphs drawn on surfaces, with particular emphasis on the one-matrix model and how it can be used to solve a map enumeration problem. It first provides an overview of maps and related objects, recalling the basic definitions related to graphs and defining maps as graphs ...
openaire +2 more sources
This article discusses the relationship between random matrices and maps, i.e. graphs drawn on surfaces, with particular emphasis on the one-matrix model and how it can be used to solve a map enumeration problem. It first provides an overview of maps and related objects, recalling the basic definitions related to graphs and defining maps as graphs ...
openaire +2 more sources
Extraction, enumeration and identification methods for monitoring microplastics in the environment
, 2016Qiongxuan Qiu +5 more
semanticscholar +1 more source
Simple Key Enumeration (and Rank Estimation) Using Histograms: An Integrated Approach
Workshop on Cryptographic Hardware and Embedded Systems, 2016R. Poussier +2 more
semanticscholar +1 more source
Fast, flexible MUS enumeration
Constraints, 2015Mark H. Liffiton +3 more
semanticscholar +1 more source