Relevant bibliographies by topics / Graphops

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Graphops'

Author: Grafiati
Published: 4 June 2021
Last updated: 29 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Graphops.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Graphops"

1

Kuehn, Christian. "Network dynamics on graphops." New Journal of Physics 22, no. 5 (2020): 053030. http://dx.doi.org/10.1088/1367-2630/ab83d4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kalampakas, Antonios. "Graph Automata and Graph Colorability." European Journal of Pure and Applied Mathematics 16, no. 1 (2023): 112–20. http://dx.doi.org/10.29020/nybg.ejpam.v16i1.4629.

Full text
Abstract:
Automata recognizing graphs can be constructed by employing the algebraic structure of graphoids. For the construction of a graph automaton, the relations over the Kleene star of the state set must constitute a graphoid. Hence different kinds of graphoids produce graph automata with diverse operation and recognition capacity. In this paper we show that graph colorability is recognized by automata operating over the simplest possible abelian graphoid.
APA, Harvard, Vancouver, ISO, and other styles
3

SHOJAEI-FARD, Ali. "Kontsevich Graphons." Kragujevac Journal of Mathematics 47, no. 2 (2023): 213–28. http://dx.doi.org/10.46793/kgjmat2302.213s.

Full text
Abstract:
The article applies graph functions to extend the Kontsevich differential graded Lie algebraic formalism (in Deformation Quantization) to infinite Kontsevich graphs on the basis of the Connes-Kreimer Hopf algebraic renormalization and the theory of noncommutative differential geometry.
APA, Harvard, Vancouver, ISO, and other styles
4

Sidorova, Oksana. "CLASSICAL GRAPHIC ARTISTS OF ALTAI IN COLLECTIONS OF THE STATE ART MUSEUM OF THE ALTAI KRAI (BARNAUL, RUSSIA)." Proceedings of Altai State Academy of Culture and Arts, no. 3 (2021): 52–59. http://dx.doi.org/10.32340/2414-9101-2021-3-52-59.

Full text
Abstract:
The reported study was funded by Russian Fund of Basic Research according to the research project no. 19-412-220003 r_a. The paper outlines basic biographic information that reflects creative way of professional graphic artists from Altai, Russia: Fyodor Filonov (1919–2007), Andrei Vagin (1923–2006), Alexei Yugatkin (1926–2001), and Aleksandr Deriavsky (1927–2017), whose works will be in exhibition “Classical Works of Altai's Graphis Artists” of The State Art Museum of the Altai Krai (Barnaul, Russia) that will be held in 2022, after reconstruction of the institution's building. Individual art
APA, Harvard, Vancouver, ISO, and other styles
5

Latoschik, Marc Erich. "Smart Graphics/Intelligent Graphics." Informatik-Spektrum 37, no. 1 (2014): 36–41. http://dx.doi.org/10.1007/s00287-013-0759-z.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nagy, Attila. "Remarks on graphons." International Journal of Algebra 15, no. 2 (2021): 61–68. http://dx.doi.org/10.12988/ija.2021.91526.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lovász, L., and B. Szegedy. "Finitely forcible graphons." Journal of Combinatorial Theory, Series B 101, no. 5 (2011): 269–301. http://dx.doi.org/10.1016/j.jctb.2011.03.005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hladký, Jan, Ping Hu, and Diana Piguet. "Tilings in graphons." European Journal of Combinatorics 93 (March 2021): 103284. http://dx.doi.org/10.1016/j.ejc.2020.103284.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Malnič, Aleksander, and Boris Zgrablić. "Coverings of Graphoids: Existence Theorem and Decomposition Theorems." Symmetry 16, no. 3 (2024): 375. http://dx.doi.org/10.3390/sym16030375.

Full text
Abstract:
A graphoid is a mixed multigraph with multiple directed and/or undirected edges, loops, and semiedges. A covering projection of graphoids is an onto mapping between two graphoids such that at each vertex, the mapping restricts to a local bijection on incoming edges and outgoing edges. Naturally, as it appears, this definition displays unusual behaviour since the projection of the corresponding underlying graphs is not necessarily a graph covering. Yet, it is still possible to grasp such coverings algebraically in terms of the action of the fundamental monoid and combinatorially in terms of vol
APA, Harvard, Vancouver, ISO, and other styles
10

Rager, John E. "Graphics packages for teaching graphics." ACM SIGCSE Bulletin 18, no. 1 (1986): 225–31. http://dx.doi.org/10.1145/953055.5902.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Graphops"

1

Yang, Weihua. "Supereulerian graphs, Hamiltonicity of graphes and several extremal problems in graphs." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00877793.

Full text
Abstract:
In this thesis, we focus on the following topics: supereulerian graphs, hamiltonian line graphs, fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees, and several extremal problems on the (minimum and/or maximum) size of graphs under a given graph property. The thesis includes six chapters. The first one is to introduce definitions and summary the main results of the thesis, and in the last chapter we introduce the furture research of the thesis. The main studies in Chapters 2 - 5 are as follows. In Chapter 2, we explore conditions for a graph to be supereul
APA, Harvard, Vancouver, ISO, and other styles
2

Sen, Sagnik. "A contribution to the theory of graph homomorphisms and colorings." Phd thesis, Bordeaux, 2014. http://tel.archives-ouvertes.fr/tel-00960893.

Full text
Abstract:
Dans cette thèse, nous considérons des questions relatives aux homomorphismes de quatre types distincts de graphes : les graphes orientés, les graphes orientables, les graphes 2-arête colorés et les graphes signés. Pour chacun des ces quatre types, nous cherchons à déterminer le nombre chromatique, le nombre de clique relatif et le nombre de clique absolu pour différentes familles de graphes planaires : les graphes planaires extérieurs, les graphes planaires extérieurs de maille fixée, les graphes planaires et les graphes planaires de maille fixée. Nous étudions également les étiquetages "2-di
APA, Harvard, Vancouver, ISO, and other styles
3

Tanasescu, Mihaela-Cerasela. "Graphes, Partitions et Classes : G-graphs et leurs applications." Thesis, Antilles-Guyane, 2014. http://www.theses.fr/2014AGUY0787/document.

Full text
Abstract:
Les graphes définis à partir de structures algébriques possèdent d’excellentes propriétés de symétries particulièrement intéressantes. L’exemple le plus flagrant est la notion de graphe de Cayley qui s’est révélée très riche non seulement du point de vue théorique mais aussi pratique par ses applications à de nombreux domaines incluant l’architecture des réseaux ou les machines parallèles. Néanmoins, la régularité des graphes de Cayley se révèle parfois être une limite étant donné qu’ils sont toujours sommet-transitifs et donc en particulier non pertinents pour générer des réseaux semirégulier
APA, Harvard, Vancouver, ISO, and other styles
4

Musco, Vincenzo. "Propagation Analysis based on Software Graphs and Synthetic Data." Thesis, Lille 3, 2016. http://www.theses.fr/2016LIL30053/document.

Full text
Abstract:
Les programmes sont partout dans notre vie quotidienne : les ordinateurs et les téléphones, mais aussi les frigo, les avions et ainsi de suite. L'acteur principal dans la création de ces programmes est humain les êtres. Aussi minutie qu'ils peuvent être, les humains sont connus pour faire des erreurs involontaires sans leur conscience. Ainsi, une fois une phase déjà difficile d'écriture d'un programme, ils doivent faire face à la phase de maintenance sur laquelle ils doivent faire face aux erreurs qu'ils ont eu précédemment réalisé. Toute la durée de leur tâche de développement, les développeu
APA, Harvard, Vancouver, ISO, and other styles
5

Weibel, Julien. "Graphons de probabilités, limites de graphes pondérés aléatoires et chaînes de Markov branchantes cachées." Electronic Thesis or Diss., Orléans, 2024. http://www.theses.fr/2024ORLE1031.

Full text
Abstract:
Les graphes sont des objets mathématiques qui servent à modéliser tout type de réseaux, comme les réseaux électriques, les réseaux de communications et les réseaux sociaux. Formellement un graphe est composé d'un ensemble de sommets et d'un ensemble d'arêtes reliant des paires de sommets. Les sommets représentent par exemple des individus, tandis que les arêtes représentent les interactions entre ces individus. Dans le cas d'un graphe pondéré, chaque arête possède un poids ou une décoration pouvant modéliser une distance, une intensité d'interaction, une résistance. La modélisation de réseaux
APA, Harvard, Vancouver, ISO, and other styles
6

Ardevol, Martinez Virginia. "Structural and algorithmic aspects of (multiple) interval graphs." Electronic Thesis or Diss., Université Paris sciences et lettres, 2024. http://www.theses.fr/2024UPSLD028.

Full text
Abstract:
Les graphes d’intervalles multiples sont une généralisation bien connue des graphes d’intervalles, où chaque sommet d’un graphe est représenté par un d-intervalle (l’union de d intervalles) pour un certain nombre naturel d > 1, et il existe une arête entre deux sommets si et seulement si leurs d-intervalles correspondants se croisent. En particulier, un graphe de d-intervalles est unitaire si tous les intervalles de la représentation ont une longueur unitaire. Dans cette thèse, nous étudions les graphes de d-intervalles unitaires d’un point de vue structurel et algorithmique. Dans la premiè
APA, Harvard, Vancouver, ISO, and other styles
7

Isenmann, Lucas. "Des graphes planaires vers des dimensions supérieures." Thesis, Montpellier, 2019. http://www.theses.fr/2019MONTS142.

Full text
Abstract:
Dans cette thèse on cherche à généraliser certaines propriétés des graphes planaires aux dimensions supérieures en remplaçant les graphes par des complexes simpliciaux. En particulier on étudie la dimension de Dushnik-Miller qui mesure à quel point un ordre partiel ressemble à un ordre total. Appliquée aux complexes simpliciaux, cette dimension semble capturer des propriétés géométriques. Concernant ce sujet, on infirme une conjecture assurant que n'importe quel complexe simplicial de dimension de Dushnik-Miller au plus d+1 peut être représenté par un complexe de TD-Delaunay dans RR d, qui est
APA, Harvard, Vancouver, ISO, and other styles
8

Valicov, Petru. "Problèmes de placement, de coloration et d’identification." Thesis, Bordeaux 1, 2012. http://www.theses.fr/2012BOR14549/document.

Full text
Abstract:
Dans cette thèse, nous nous intéressons à trois problèmes issus de l'informatique théorique, à savoir le placement de formes rectangulaires dans un conteneur (OPP), la coloration dite "forte" d'arêtes des graphes et les codes identifiants dans les graphes. L'OPP consiste à décider si un ensemble d'items rectangulaires peut être placé sans chevauchement dans un conteneur rectangulaire et sans dépassement des bords de celui-ci. Une contrainte supplémentaire est prise en compte, à savoir l'interdiction de rotation des items. Le problème est NP-difficile même dans le cas où le conteneur et les for
APA, Harvard, Vancouver, ISO, and other styles
9

Le, Tien Nam. "Patterns in Large Graphs." Thesis, Lyon, 2018. http://www.theses.fr/2018LYSEN079/document.

Full text
Abstract:
Un graphe est un ensemble de noeuds, ensemble de liens reliant des paires de noeuds. Avec la quantité accumulée de données collectées, il existe un intérêt croissant pour la compréhension des structures et du comportement de très grands graphes. Néanmoins, l’augmentation rapide de la taille des grands graphes rend l’étude de tous les graphes de moins en moins efficace. Ainsi, il existe une demande impérieuse pour des méthodes plus efficaces pour étudier de grands graphes sans nécessiter la connaissance de tous les graphes. Une méthode prometteuse pour comprendre le comportement de grands graph
APA, Harvard, Vancouver, ISO, and other styles
10

Oliveira, Ana Karolinna Maia de. "Subdivisions de digraphes." Thesis, Nice, 2014. http://www.theses.fr/2014NICE4084/document.

Full text
Abstract:
Dans ce travail, nous considérons le problème suivant : étant donné un graphe orienté D, contient-il une subdivision d’un digraphe fixé F ? Nous pensons qu’il existe une dichotomie entre les instances polynomiales et NP-complètes. Nous donnons plusieurs exemples pour les deux cas. En particulier, sauf pour cinq instances, nous sommes capable de classer tous les digraphes d’ordre 4. Alors que toutes les preuves NP-complétude sont faites par réduction de une version du problème 2-linkage en digraphes, nous utilisons différents outils algorithmiques pour prouver la solvabilité en temps polynomial
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Graphops"

1

Specht, Jim. More than graphs: Activities for the TI graphics calculator. Key Curriculum Press, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Isakov, Vladimir. Speak the language of schemes. INFRA-M Academic Publishing LLC., 2022. http://dx.doi.org/10.12737/1860649.

Full text
Abstract:
Schematization and visualization are the necessary means to ensure the activity of a modern specialist. Schematization allows you to highlight the main thing in an object, to discover its constituent elements, to show their relationship, gives impetus to the construction of conceptual approaches. Visualization "dresses" schematic concepts in a bright, expressive artistic and graphic form. The handbook provides descriptions of the most popular means of analytical graphics - maps, graphs, tables, graphs, diagrams, flowcharts (algorithms), chronolents, maps, methodological schemes, etc. The ways
APA, Harvard, Vancouver, ISO, and other styles
3

Kazuo, Abe, Nishioka Fumihiko 1952-, and Pie Bukkusu (firm), eds. Diagram graphics: The best in graphs, charts, maps and technical illustration. PIE Books, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Blackett, Norman. Computer graphics and children's understanding of linear and locally linear graphs. typescript, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Fumihiko, Nishioka, ed. Diagram graphics: The best in graphs, charts, maps and technical illustration. Nippan, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Banerjee, Amitabha. Graphics. Chitrakoot Art Gallery, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

David, Barlex, Compton Jo, and Nuffield Foundation, eds. Graphics. Longman, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

O'Hare, Elspeth. Graphics. Films for the Humanities and Sciences, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Giesecke, Frederick E. Engineering graphics, with Computer graphics. 3rd ed. Macmillan, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Palaiologos, Gre gorios. O zo graphos. Idryma Ourane, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Graphops"

1

Kurasov, Pavel. "M-Functions: Definitions and Examples." In Operator Theory: Advances and Applications. Springer Berlin Heidelberg, 2023. http://dx.doi.org/10.1007/978-3-662-67872-5_17.

Full text
Abstract:
AbstractM-functions associated with quantum graphs provide an efficient tool not only to describe spectral properties of quantum graphs, but to solve the inverse problems. The goal of this chapter is to give a self-consistent introduction to the theory of the graph’s M-functions.
APA, Harvard, Vancouver, ISO, and other styles
2

Kurasov, Pavel. "Vertex Conditions." In Operator Theory: Advances and Applications. Springer Berlin Heidelberg, 2023. http://dx.doi.org/10.1007/978-3-662-67872-5_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Nachmanson, Lev, Roman Prutkin, Bongshin Lee, Nathalie Henry Riche, Alexander E. Holroyd, and Xiaoji Chen. "GraphMaps: Browsing Large Graphs as Interactive Maps." In Lecture Notes in Computer Science. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27261-0_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Beneš, Nikola, Luboš Brim, Samuel Pastva, and David Šafránek. "Symbolic Coloured SCC Decomposition." In Tools and Algorithms for the Construction and Analysis of Systems. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72013-1_4.

Full text
Abstract:
AbstractProblems arising in many scientific disciplines are often modelled using edge-coloured directed graphs. These can be enormous in the number of both vertices and colours. Given such a graph, the original problem frequently translates to the detection of the graph’s strongly connected components, which is challenging at this scale.We propose a new, symbolic algorithm that computes all the monochromatic strongly connected components of an edge-coloured graph. In the worst case, the algorithm performs $$O(p\cdot n\cdot \log n)$$ O ( p · n · log n ) symbolic steps, where p is the number of
APA, Harvard, Vancouver, ISO, and other styles
5

Muenchen, Robert A. "Traditional Graphics graphics graphics traditional." In Statistics and Computing. Springer New York, 2008. http://dx.doi.org/10.1007/978-0-387-09418-2_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tran, Ha-Nguyen, Jung-jae Kim, and Bingsheng He. "Fast Subgraph Matching on Large Graphs using Graphics Processors." In Database Systems for Advanced Applications. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-18120-2_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Tian, Sheng, Xintan Zeng, Yifei Hu, et al. "GraphRPM: Risk Pattern Mining on Industrial Large Attributed Graphs." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-70381-2_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Muenchen, Robert A. "Graphics with ggplot2 (GPL) graphics graphics Grammar of Graphics." In Statistics and Computing. Springer New York, 2008. http://dx.doi.org/10.1007/978-0-387-09418-2_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Dea, Carl, Gerrit Grunwald, José Pereda, Sean Phillips, and Mark Heckler. "Graphics." In JavaFX 9 by Example. Apress, 2017. http://dx.doi.org/10.1007/978-1-4842-1961-4_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kaufmann, Stephan. "Graphics." In A Crash Course in Mathematica. Birkhäuser Basel, 1999. http://dx.doi.org/10.1007/978-3-0348-7589-9_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Graphops"

1

Prisant, Raoul, Federica Garin, and Paolo Frasca. "Opinion dynamics on signed graphs and graphons: Beyond the piece-wise constant case." In 2024 IEEE 63rd Conference on Decision and Control (CDC). IEEE, 2024. https://doi.org/10.1109/cdc56724.2024.10886059.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Oguntebi, Tayo, and Kunle Olukotun. "GraphOps." In FPGA'16: The 2016 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays. ACM, 2016. http://dx.doi.org/10.1145/2847263.2847337.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Navarro, Madeline, and Santiago Segarra. "Graphon-Aided Joint Estimation of Multiple Graphs." In ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2022. http://dx.doi.org/10.1109/icassp43922.2022.9746332.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Francis, Krista, Michele Jacobsen, and Sharon Friesen. "The Use of Graphics to Communicate Findings of Longitudinal Data in Design-Based Research." In InSITE 2015: Informing Science + IT Education Conferences: USA. Informing Science Institute, 2015. http://dx.doi.org/10.28945/2240.

Full text
Abstract:
Visuals and graphics have been used for communicating complex ideas since 1786 when William Playfair first invented the line graph and bar chart. Graphs and charts are useful for interpretation and making sense of data. For instance, John Snow’s scatter plot helped pinpoint the source of a cholera outbreak in London in 1854 and also changed understandings of how germs were spread. While popular in the field of information graphics, rarely are graphs beyond the bar chart found in educational research articles. When present, the graphs do not necessarily enhance the findings of the data. Nor do
APA, Harvard, Vancouver, ISO, and other styles
5

Vargas, Hernán, Carlos Buil-Aranda, Aidan Hogan, and Claudia López. "A User Interface for Exploring and Querying Knowledge Graphs (Extended Abstract)." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/666.

Full text
Abstract:
As the adoption of knowledge graphs grows, more and more non-experts users need to be able to explore and query such graphs. These users are not typically familiar with graph query languages such as SPARQL, and may not be familiar with the knowledge graph's structure. In this extended abstract, we provide a summary of our work on a language and visual interface -- called RDF Explorer -- that help non-expert users to navigate and query knowledge graphs. A usability study over Wikidata shows that users successfully complete more tasks with RDF Explorer than with the existing Wikidata Query Helpe
APA, Harvard, Vancouver, ISO, and other styles
6

A. Alsammarraie, Omar, Qusay H. Al-Salami, and Noor Q. Al-Salami. "Transforming Coordinate Function Points into 2D or 3D Graphics: An Algorithmic Approach." In 5TH INTERNATIONAL CONFERENCE ON COMMUNICATION ENGINEERING AND COMPUTER SCIENCE (CIC-COCOS'24). Cihan University-Erbil, 2024. http://dx.doi.org/10.24086/cocos2024/paper.1562.

Full text
Abstract:
Our research demonstrates the process of converting paper graphs into corresponding coordinates on a computer screen, whether in two-dimensional or three-dimensional form, through simplified mathematical equations. These equations are designed to enable users to comprehend their structure and develop their own code, avoiding reliance on ambiguous pre-built programs. To accomplish this, the initial phase involved understanding graph reading and interpretation methods through an extensive literature review. The process of transforming coordinate function points into 2D or 3D graphics involves se
APA, Harvard, Vancouver, ISO, and other styles
7

Ruiz, Luana, Luiz F. O. Chamon, and Alejandro Ribeiro. "Graphon Filters: Signal Processing in Very Large Graphs." In 2020 28th European Signal Processing Conference (EUSIPCO). IEEE, 2021. http://dx.doi.org/10.23919/eusipco47968.2020.9287695.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Salcedo, Audy, Jesús González, Amalio Sarco LIra, and Johnnalid González. "Statistical Literacy of Citizens: The Interpretation of Statistical Graphs." In Bridging the Gap: Empowering and Educating Today’s Learners in Statistics. International Association for Statistical Education, 2022. http://dx.doi.org/10.52041/iase.icots11.t7a1.

Full text
Abstract:
This article analyzes how a group of Venezuelan citizens interprets two bar graphs. The reading, interpretation and evaluation of statistical graphs is part of the competences that an ordinary citizen must possess. It was therefore decided to ask ordinary citizens to interpret two statistical graphs. The questions are part of a broader questionnaire that was published on the survey administration platform and sent to potential participants, using non-probability sampling. The questions were answered by 407 citizens with different levels of academic training. The results show that most particip
APA, Harvard, Vancouver, ISO, and other styles
9

Campos, Raphael R., Ricardo Ferreira, Julio C. Goldner Vendramini, Fábio Cerqueira, and Marcelo Lobato Martins. "Simulation of Scale Free Gene Regulatory Networks based on Threshold Functions on GPU." In Simpósio em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação, 2011. http://dx.doi.org/10.5753/wscad.2011.17271.

Full text
Abstract:
Gene regulatory networks have been used to study diseases and cell evolution, where Random Boolean graphs are one of computational approaches. A Boolean graph is a simple and effective model, and its dynamic behavior has been used in several works. This article proposes an efficient environment to simulate Boolean graph on GPU (Graphics Processing Units). The dynamic behavior of a Boolean graph is computed by visiting the whole or a subset of state space. The proposed tool is based on statistical approaches to evaluate large graphs. Moreover, it can take into account scale free graphs with thr
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Dehua, Tiago Pimentel, Adriano Veloso, and Nivio Ziviani. "Denoising Node Embeddings." In LatinX in AI at Neural Information Processing Systems Conference 2018. Journal of LatinX in AI Research, 2018. http://dx.doi.org/10.52591/lxai201812033.

Full text
Abstract:
Node embedding (NE) algorithms capture features of graph’s nodes and represent them in a low dimensional vector space. Graphs are inherently noisy structures, which might reduce the learned representations quality. We propose a novel approach using denoising autoencoders to reduce noise in the learned representation of nodes. Experiments with three state-of-the-art NE algorithms show that our approach effectively reduces noise in a link prediction task.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Graphops"

1

Couture, R. G. Graphics Technology Study. Volume 1. State of Graphics Technology. Defense Technical Information Center, 1986. http://dx.doi.org/10.21236/ada176670.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dow, Stephen J. BST Graphics Platform. Defense Technical Information Center, 2004. http://dx.doi.org/10.21236/ada427758.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Azar, Maurice, Mike Clark, Nicholas J. Stute, Holly S. Bautsch, and Matthew R. Gdowski. 3D Graphics Investigation. Defense Technical Information Center, 1998. http://dx.doi.org/10.21236/ada389195.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Spielman, Frankie E. Raster graphics validation. National Institute of Standards and Technology, 1992. http://dx.doi.org/10.6028/nist.ir.4848.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Morlan, Christopher E. Generating Vehicle Graphics. Defense Technical Information Center, 1986. http://dx.doi.org/10.21236/ada173970.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Badler, Norman I. Computer Graphics Research Laboratory. Defense Technical Information Center, 1994. http://dx.doi.org/10.21236/ada281460.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Stanton, Brian, Yee-Yin Choong, Mary Theofanos, and Patrick Hofmann. Quick capture platform graphics. National Institute of Standards and Technology, 2009. http://dx.doi.org/10.6028/nist.ir.7646.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Nuttall, H. E. Development of computer graphics. Office of Scientific and Technical Information (OSTI), 1989. http://dx.doi.org/10.2172/10183316.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

DEPARTMENT OF THE ARMY WASHINGTON DC. Operational Terms and Graphics. Defense Technical Information Center, 1997. http://dx.doi.org/10.21236/ada352265.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Spielman, Frankie E. Raster graphics conformance testing. National Institute of Standards and Technology, 1991. http://dx.doi.org/10.6028/nist.ir.4524.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Graphops' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography