Log in

Relevant bibliographies by topics / Projection de graphe

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Projection de graphe'

Author: Grafiati

Published: 25 May 2024

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 'Projection de graphe.'

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 "Projection de graphe"

1

Mezroui, Yahya. "Projection orthogonale sur le graphe d’une relation linéaire fermé." Transactions of the American Mathematical Society 352, no. 6 (1999): 2789–800. http://dx.doi.org/10.1090/s0002-9947-99-02410-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Ledermann, Florian. "Classifying Cartographic Projections Based on Dynamic Analysis of Program Code." Abstracts of the ICA 2 (October 9, 2020): 1. http://dx.doi.org/10.5194/ica-abs-2-38-2020.

Full text

Abstract:

Abstract. Analyzing a given map to identify its projection and other geometrical properties has long been an important aspect of cartographic analysis. If explicit information about the projection used in a particular map is not available, the properties of the cartographic transformation can sometimes be reconstructed from the map image. However, such a process of projection analysis requires significant manual labor and oversight.For digital maps, we usually expect the projection from geographic space to map space to have been calculated by a computer program. Such a program can be expected

APA, Harvard, Vancouver, ISO, and other styles

3

Dilworth, Stephen J., Denka Kutzarova, and Mikhail I. Ostrovskii. "Lipschitz-free Spaces on Finite Metric Spaces." Canadian Journal of Mathematics 72, no. 3 (2019): 774–804. http://dx.doi.org/10.4153/s0008414x19000087.

Full text

Abstract:

AbstractMain results of the paper are as follows:(1) For any finite metric space $M$ the Lipschitz-free space on $M$ contains a large well-complemented subspace that is close to $\ell _{1}^{n}$.(2) Lipschitz-free spaces on large classes of recursively defined sequences of graphs are not uniformly isomorphic to $\ell _{1}^{n}$ of the corresponding dimensions. These classes contain well-known families of diamond graphs and Laakso graphs.Interesting features of our approach are: (a) We consider averages over groups of cycle-preserving bijections of edge sets of graphs that are not necessarily gra

APA, Harvard, Vancouver, ISO, and other styles

4

Bae, Yeolhui, Yugyeom Yi, Jeongmoo Lee, and Sungmo Kang. "Research on Definition of BLL Graphs of Knot Diagrams and its Applications." Korean Science Education Society for the Gifted 14, no. 3 (2022): 229–36. http://dx.doi.org/10.29306/jseg.2022.14.3.229.

Full text

Abstract:

This paper is the research on the Knot theory in Topology. A knot is a simple closed curve in ℝ and its projection onto a plane in ℝ is called a knot projection. As the results of this paper we define a BLL(Bidirectional Linear Link) graph for a knot projection which is a bidirectional linear link representing the relations between arcs of a knot projection and obtain some properties of the BLL graphs. We also define an Eulerian cycle of the BLL graph and an Eulerian cycle of a knot projection. As the main results of this paper, we obtain the equivalent conditions of being an alternation knot

APA, Harvard, Vancouver, ISO, and other styles

5

Larose, Benoit. "Strongly Projective Graphs." Canadian Journal of Mathematics 54, no. 4 (2002): 757–68. http://dx.doi.org/10.4153/cjm-2002-029-7.

Full text

Abstract:

AbstractWe introduce the notion of strongly projective graph, and characterise these graphs in terms of their neighbourhood poset. We describe certain exponential graphs associated to complete graphs and odd cycles. We extend and generalise a result of Greenwell and Lovász [6]: if a connected graph G does not admit a homomorphism to K, where K is an odd cycle or a complete graph on at least 3 vertices, then the graph G × Ks admits, up to automorphisms of K, exactly s homomorphisms to K.

APA, Harvard, Vancouver, ISO, and other styles

6

Kaliszewski, S., Alex Kumjian, John Quigg, and Aidan Sims. "Topological realizations and fundamental groups of higher-rank graphs." Proceedings of the Edinburgh Mathematical Society 59, no. 1 (2015): 143–68. http://dx.doi.org/10.1017/s0013091515000061.

Full text

Abstract:

AbstractWe investigate topological realizations of higher-rank graphs. We show that the fundamental group of a higher-rank graph coincides with the fundamental group of its topological realization. We also show that topological realization of higher-rank graphs is a functor and that for each higher-rank graphΛ, this functor determines a category equivalence between the category of coverings ofΛand the category of coverings of its topological realization. We discuss how topological realization relates to two standard constructions fork-graphs: projective limits and crossed products by finitely

APA, Harvard, Vancouver, ISO, and other styles

7

NIKKUNI, RYO. "COMPLETELY DISTINGUISHABLE PROJECTIONS OF SPATIAL GRAPHS." Journal of Knot Theory and Its Ramifications 15, no. 01 (2006): 11–19. http://dx.doi.org/10.1142/s0218216506004282.

Full text

Abstract:

A generic immersion of a finite graph into the 2-space with p double points is said to be completely distinguishable if any two of the 2p embeddings of the graph into the 3-space obtained from the immersion by giving over/under information to each double point are not ambient isotopic in the 3-space. We show that only non-trivializable graphs and non-planar graphs have a non-trivial completely distinguishable immersion. We give examples of non-trivial completely distinguishable immersions of several non-trivializable graphs, the complete graph on n vertices and the complete bipartite graph on

APA, Harvard, Vancouver, ISO, and other styles

8

HUH, YOUNGSIK. "AN ELEMENTARY SET FOR EMBEDDED BOUQUET GRAPHS WITH TWO CYCLES." Journal of Knot Theory and Its Ramifications 20, no. 02 (2011): 305–25. http://dx.doi.org/10.1142/s0218216511008796.

Full text

Abstract:

A projection of the bouquet graph B with two cycles is said to be trivial if only trivial embeddings are obtained from the projection. In this paper a finite set of nontrivial embeddings of B is shown to be minimal among those which produce all nontrivial projections of B.

APA, Harvard, Vancouver, ISO, and other styles

9

Filippova, P. A. "Values of the weight system on a family of graphs that are not the intersection graphs of chord diagrams." Sbornik: Mathematics 213, no. 2 (2022): 235–67. http://dx.doi.org/10.1070/sm9519.

Full text

Abstract:

Abstract The Chmutov-Lando theorem claims that the value of a weight system (a function on the chord diagrams that satisfies the four-term Vassiliev relations) corresponding to the Lie algebra depends only on the intersection graph of the chord diagram. We compute the values of the weight system at the graphs in several infinite series, which are the joins of a graph with a small number of vertices and a discrete graph. In particular, we calculate these values for a series in which the initial graph is the cycle on five vertices; the graphs in this series, apart from the initial one, are not i

APA, Harvard, Vancouver, ISO, and other styles

10

HUH, YOUNGSIK, and KOUKI TANIYAMA. "IDENTIFIABLE PROJECTIONS OF SPATIAL GRAPHS." Journal of Knot Theory and Its Ramifications 13, no. 08 (2004): 991–98. http://dx.doi.org/10.1142/s0218216504003640.

Full text

Abstract:

A generic map from a finite graph to the 2-space is called identifiable if any two embeddings of the graph into the 3-space obtained by lifting the map with respect to the natural projection from the 3-space to the 2-space are ambient isotopic in the 3-space. We show that only planar graphs have identifiable maps. We characterize the identifiable maps for some planar graphs.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Projection de graphe"

1

Taki, Sara. "Anonymisation de données liées en utilisant la confidentialité différentielle." Electronic Thesis or Diss., Bourges, INSA Centre Val de Loire, 2023. http://www.theses.fr/2023ISAB0009.

Full text

Abstract:

Cette thèse étudie le problème de la protection de la vie privée dans le LinkedOpen Data (ou « LOD », en français « web des données ouvertes » ou encore « donnéesliées ouvertes »). Ce travail se situe à l’intersection d’une longue série de travaux sur laconfidentialité des données et le LOD. Notre objectif est d’étudier l’impact des aspectssémantiques sur la publication des données et sur les fuites éventuelles d’information.Nous considérons RDF comme le format de représentation du LOD et la confidentialitédifférentielle (DP) comme le principal critère de protection de la vie privée. La DP a é

APA, Harvard, Vancouver, ISO, and other styles

2

Hadjar, Ahmed. "Composition de polyèdres associés aux problèmes d'optimisation combinatoire." Phd thesis, Grenoble INPG, 1996. http://tel.archives-ouvertes.fr/tel-00345405.

Full text

Abstract:

Le polyèdre associé à un problème d'optimisation combinatoire est l'enveloppe convexe des (vecteurs d'incidence des) solutions réalisables de ce problème. De nombreux problèmes d'optimisation combinatoire se formulent comme une maximisation de fonctions linéaires sur les polyèdres qui leurs sont associés. La description du polyèdre par un système d'inéquations linéaires est intimement liée à la résolution du problème correspondant, par le biais de la programmation linéaire. Afin de déterminer un tel système, une approche classique consiste à décomposer le problème en sous-problèmes tels que le

APA, Harvard, Vancouver, ISO, and other styles

3

Phan, Minh-Son. "Contribution à l'estimation de la similarité dans un ensemble de projections tomographiques non-orientées." Thesis, Strasbourg, 2016. http://www.theses.fr/2016STRAD041/document.

Full text

Abstract:

La cryo-microscopie électronique est une technique tomographique permettant de reconstituer la structure 3D d’un objet complexe en biologie à partir d’un jeu d’acquisitions. Ces images de l’objet complexe sont appelées les projections et sont acquises sous orientations inconnues. Un des avantages de la cryo-microscopie électronique est l’obtention d’un modèle 3D de très haute résolution de l’objet dans un état naturel. La procédure de reconstruction comporte plusieurs étapes telles que l’alignement, la classification des projections, l’estimation de leurs orientations et le raffinement des pro

APA, Harvard, Vancouver, ISO, and other styles

4

Sun, Qiang. "A contribution to the theory of (signed) graph homomorphism bound and Hamiltonicity." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS109/document.

Full text

Abstract:

Dans cette thèse, nous etudions deux principaux problèmes de la théorie des graphes: problème d’homomorphisme des graphes planaires (signés) et problème de cycle hamiltonien.Comme une extension du théorème des quatre couleurs, il est conjecturé([80], [41]) que chaque graphe signé cohérent planaire de déséquilibré-maille d+1(d>1) admet un homomorphisme à cube projective signé SPC(d) de dimension d. La question suivant étalés naturelle:Est-ce que SPC(d) une borne optimale de déséquilibré-maille d+1 pour tous les graphes signés cohérente planaire de déséquilibré-maille d+1?Au Chapitre 2, nous

APA, Harvard, Vancouver, ISO, and other styles

5

Douar, Brahim. "Fouille de sous-graphes fréquents à base d'arc consistance." Thesis, Montpellier 2, 2012. http://www.theses.fr/2012MON20108/document.

Full text

Abstract:

Avec la croissance importante du besoin d'analyser une grande masse de données structurées tels que les composés chimiques, les structures de protéines ou même les réseaux sociaux, la fouille de sous-graphes fréquents est devenue un défi réel en matière de fouille de données. Ceci est étroitement lié à leur nombre exponentiel ainsi qu'à la NP-complétude du problème d'isomorphisme d'un sous-graphe général. Face à cette complexité, et pour gérer cette taille importante de l'espace de recherche, les méthodes classiques de fouille de graphes ont exploré des heuristiques de recherche basées sur le

APA, Harvard, Vancouver, ISO, and other styles

6

Matignon, Daniel. "Plans projectifs créés par obturation de Dehn : application à l'impossibilité d'obtenir l'espace projectif réel de dimension trois." Aix-Marseille 1, 1996. http://www.theses.fr/1996AIX11024.

Full text

Abstract:

Les principaux resultats de ce travail concernent la possibilite d'obtenir l'espace projectif reel de dimension trois, note p#3, par chirurgie de dehn sur un nud non-trivial de s#3. Nous ramenons le probleme chirurgical a un probleme purement combinatoire. Il s'agit d'etudier les proprietes d'un couple de graphes d'intersection (g, h) provenant respectivement d'un plan projectif minimal (dans p#3) et d'une 2-sphere de niveau prise dans une presentation mince du nud (dans s#3). C. Mca. Gordon et j. Luecke ont utilise une demarche similaire dans la solution au probleme du complement (s#3 jouant

APA, Harvard, Vancouver, ISO, and other styles

7

Delhommé, Christian. "Propriétés de projection." Lyon 1, 1995. http://www.theses.fr/1995LYO10159.

Full text

Abstract:

La propriete de projection a ete introduite par ernest corominas pour les ensembles ordonnes : un ensemble ordonne est 2-projectif si les projections sont ses seules operations binaires, croissantes et identiques sur la diagonale. L'objet de cette these est l'etude d'extensions de cette notion, a des operations d'arite superieure (projectivite de hamming finie et projectivite cartesienne infinie) et a des structures plus generales. Notre etude des proprietes de projection de hamming (relatives a des operations regulieres par rapport a chaque argument) est fondee sur des idees de topologie alge

APA, Harvard, Vancouver, ISO, and other styles

8

Hansen, Bret. "Graphic Design as Projection." VCU Scholars Compass, 2010. http://scholarscompass.vcu.edu/etd/2117.

Full text

Abstract:

I imagined a world where designing is projecting and where the entire design field is called projection. My research into what it means to be a projector culminates in a participatory creative project that embodies concepts of projection taken from a range of disparate subjects.

APA, Harvard, Vancouver, ISO, and other styles

9

Tsukamoto, Tatsuya. "Knot-inevitable projections of planar graphs /." Electronic version of summary, 1999. http://www.wul.waseda.ac.jp/gakui/gaiyo/2870.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Luqman, Muhammad Muzzamil. "Fuzzy multilevel graph embedding for recognition, indexing and retrieval of graphic document images." Thesis, Tours, 2012. http://www.theses.fr/2012TOUR4005/document.

Full text

Abstract:

Cette thèse aborde le problème du manque de performance des outils exploitant des représentationsà base de graphes en reconnaissance des formes. Nous proposons de contribuer aux nouvellesméthodes proposant de tirer partie, à la fois, de la richesse des méthodes structurelles et de la rapidité des méthodes de reconnaissance de formes statistiques. Deux principales contributions sontprésentées dans ce manuscrit. La première correspond à la proposition d'une nouvelle méthode deprojection explicite de graphes procédant par analyse multi-facettes des graphes. Cette méthodeeffectue une caractérisati

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Projection de graphe"

1

Hemispherical projection methods in rock mechanics. Allen & Unwin, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Shepherd, Angela. Australian wine grape production and winery intake: Projections to 2002-03. ABARE, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Projective graphics: The first album. Hertfordshire Press, 2014.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Ali, Abdalla, and Australian Bureau of Agricultural and Resource Economics., eds. Wine grapes: Projections of wine grape production and winery intake to 1994-95. Australian Bureau of Agricultural and Resource Economics, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Guriev, T. S. Trimetricheskie proekt͡s︡ii. "Nedra", 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Sal'kov, Nikolay. Descriptive geometry. INFRA-M Academic Publishing LLC., 2022. http://dx.doi.org/10.12737/1874094.

Full text

Abstract:

The textbook contains a complete course on descriptive geometry for architects. It covers the theoretical issues of orthogonal projections, axonometry, perspective and shadow theory in these sections. It fully meets the requirements of the Federal State Educational Standard of Secondary Vocational Education, approved by the order of the Ministry of Education and Science of the Russian Federation No. 850 dated July 28, 2014. It is addressed to students of secondary vocational education institutions studying in the specialty 07.02.01 "Architecture". It can be useful for students of o

APA, Harvard, Vancouver, ISO, and other styles

7

Rodin, Esquejo, and Alphona Adrian, eds. Mind the gap: Intimate strangers. Image Comics, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Dunn, Brenda. Les spectacles de lanterne magique et l'armée britannique: Matériel de projection de la garnison de Halifax dans les années 1860. Patrimoine canadien, Parcs Canada, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

1624-1683, Guarini Guarino, and Università di Roma. Dipartimento di rilievo, analisi, disegno dell'ambiente e dell'architettura., eds. La scienza della rappresentazione nella concezione di Guarino Guarini. Gangemi, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Shades of Simon Gray. Delacorte Press, 2001.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Projection de graphe"

1

Falb, Peter. "Projective Algebraic Geometry III: Products, Graphs, Projections." In Methods of Algebraic Geometry in Control Theory: Part II. Birkhäuser Boston, 1999. http://dx.doi.org/10.1007/978-1-4612-1564-6_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Falb, Peter. "Projective Algebraic Geometry III: Products, Graphs, Projections." In Methods of Algebraic Geometry in Control Theory: Part II. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96574-1_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Yarwood, A. "Orthographic Projection." In Work Out Graphic Communication GCSE. Macmillan Education UK, 1988. http://dx.doi.org/10.1007/978-1-349-10242-6_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

van Wyk, Barend Jacobus, Michaël Antonie van Wyk, and Hubert Edward Hanrahan. "Successive Projection Graph Matching." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-70659-3_27.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Aravind, N. R., and Udit Maniyar. "Planar Projections of Graphs." In Algorithms and Discrete Applied Mathematics. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39219-2_36.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Bose, Prosenjit, Pedro Ramos, Francisco Gomez, and Godfried Toussaint. "Drawing nice projections of objects in space." In Graph Drawing. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0021790.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Husák, Martin, Joseph Khoury, Đorđe Klisura, and Elias Bou-Harb. "On the Provision of Network-Wide Cyber Situational Awareness via Graph-Based Analytics." In Complex Computational Ecosystems. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-44355-8_12.

Full text

Abstract:

AbstractIn this paper, we posit how semi-static (i.e., not changing very often) complex computer network-based intelligence using graph-based analytics can become enablers of Cyber Situational Awareness (CSA) (i.e., perception, comprehension, and projection of situations in a cyber environment). A plethora of newly surfaced cyber security researchers have used graph-based analytics to facilitate particular down tasks in dynamic complex cyber environments. This includes graph-, node- and edge-level detection, classification, and others (e.g., credit card fraudulent transactions as an edge classification problem). To the best of our knowledge, very limited efforts have consolidated the outputs of heterogeneous computer network monitoring and reconnaissance tools (e.g., Nmap) in enabling actionable CSA. As such, in this work, we address this literature gap while describing several use cases of graph traversal, graph measures, and subgraph mining in vulnerability and security state assessment, attack projection and mitigation, and device criticality estimation. We highlight the benefits of the graph-based approaches compared to traditional methods. Finally, we postulate open research and application challenges in graph-based analytics for CSA to prompt promising research directions and operational capabilities.

APA, Harvard, Vancouver, ISO, and other styles

8

Dwyer, Tim, and George Robertson. "Layout with Circular and Other Non-linear Constraints Using Procrustes Projection." In Graph Drawing. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11805-0_37.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Willems, M. "Projection and unification for conceptual graphs." In Conceptual Structures: Applications, Implementation and Theory. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60161-9_44.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

de Ridder, H. N., and H. L. Bodlaender. "Graph automorphisms with maximal projection distances." In Fundamentals of Computation Theory. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48321-7_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Projection de graphe"

1

Liu, Hanyang, Junwei Han, and Feiping Nie. "Semi-supervised Orthogonal Graph Embedding with Recursive Projections." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/321.

Full text

Abstract:

Many graph based semi-supervised dimensionality reduction algorithms utilize the projection matrix to linearly map the data matrix from the original feature space to a lower dimensional representation. But the dimensionality after reduction is inevitably restricted to the number of classes, and the learned non-orthogonal projection matrix usually fails to preserve distances well and balance the weight on different projection direction. This paper proposes a novel dimensionality reduction method, called the semi-supervised orthogonal graph embedding with recursive projections (SOGE). We integra

APA, Harvard, Vancouver, ISO, and other styles

2

Wilde, D. J. "Two Generalizations of the Isometric Projection in Geometric Design." In ASME 1987 Design Technology Conferences. American Society of Mechanical Engineers, 1987. http://dx.doi.org/10.1115/detc1987-0045.

Full text

Abstract:

Abstract The well-known pictorial drafting technique of isometric drawing is here generalized in two ways, called “isoclinal” and “axial”, or collectively, “symmetric”. Although the isoclinal projection preserves the useful property of foreshortening adjacent edges equally, and the axial projection foreshortens adjacent edges equally, the directions for these projections usually differ from that for isometric projection. Formulas are derived for the isoclinal and axial directions and their foreshortening factors and rotation matrices. Although intended for three-dimensional computer-aided desi

APA, Harvard, Vancouver, ISO, and other styles

3

Lu, Yueheng, Runjia Tian, Ao Li, Xiaoshi Wang, and Garcia del Castillo Lopez Jose Luis. "CubiGraph5K - Organizational Graph Generation for Structured Architectural Floor Plan Dataset." In CAADRIA 2021: Projections. CAADRIA, 2021. http://dx.doi.org/10.52842/conf.caadria.2021.1.081.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Shekhawat, Krishnendra. "A Graph Theoretic Approach for the Automated Generation of Dimensioned Floorplans." In CAADRIA 2021: Projections. CAADRIA, 2021. http://dx.doi.org/10.52842/conf.caadria.2021.1.141.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Wan, Hai, Yonghao Luo, Bo Peng, and Wei-Shi Zheng. "Representation Learning for Scene Graph Completion via Jointly Structural and Visual Embedding." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/132.

Full text

Abstract:

This paper focuses on scene graph completion which aims at predicting new relations between two entities utilizing existing scene graphs and images. By comparing with the well-known knowledge graph, we first identify that each scene graph is associated with an image and each entity of a visual triple in a scene graph is composed of its entity type with attributes and grounded with a bounding box in its corresponding image. We then propose an end-to-end model named Representation Learning via Jointly Structural and Visual Embedding (RLSV) to take advantages of structural and visual information

APA, Harvard, Vancouver, ISO, and other styles

6

Mathieson, James L., and Joshua D. Summers. "Complexity Metrics for Directional Node-Link System Representations: Theory and Applications." In ASME 2010 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/detc2010-28561.

Full text

Abstract:

This paper presents an approach to defining and quantifying the complexity of systems as represented in mixed (directed and non-directed) bipartite graphs through the presentation of a central example as well as other applications. The approach presented defines nine measurements of different properties of the graph system. These measurements are derived from the representation of the system into a three dimension relational design structure matrix as well as the projections and transformations of this matrix. The metrics generated address dimensional and connective size, shortest path propert

APA, Harvard, Vancouver, ISO, and other styles

7

Eslami, Mohammed, George Zheng, Hamed Eramian, and Georgiy Levchuk. "Deriving cyber use cases from graph projections of cyber data represented as bipartite graphs." In 2017 IEEE International Conference on Big Data (Big Data). IEEE, 2017. http://dx.doi.org/10.1109/bigdata.2017.8258511.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Horvat, E.-A., and K. A. Zweig. "One-mode Projection of Multiplex Bipartite Graphs." In 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012). IEEE, 2012. http://dx.doi.org/10.1109/asonam.2012.101.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Ahmed, Nesreen, Nick Duffield, and Liangzhen Xia. "Sampling for Approximate Bipartite Network Projection." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/456.

Full text

Abstract:

Bipartite graphs manifest as a stream of edges that represent transactions, e.g., purchases by retail customers. Recommender systems employ neighborhood-based measures of node similarity, such as the pairwise number of common neighbors (CN) and related metrics. While the number of node pairs that share neighbors is potentially enormous, only a relatively small proportion of them have many common neighbors. This motivates finding a weighted sampling approach to preferentially sample these node pairs. This paper presents a new sampling algorithm that provides a fixed size unbiased estimate of th

APA, Harvard, Vancouver, ISO, and other styles

10

Weng, Yulai, Andrew Specian, and Mark Yim. "Low Cost Optical Mechanical System for Human Robot Interaction." In ASME 2018 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/imece2018-87885.

Full text

Abstract:

This paper presents the design of a low cost system that can be used as a spherical humanoid robot head to display expressive animations for social robotics. The system offers a versatile canvas for Human Robot Interaction (HRI), especially for face to face communication. To maximize flexibility, both in the style and apparent motion of the robot’s head, we exploit the relatively recent availability of low-cost portable projectors in a retro-projected animated face (RAF). The optical mechanical system is comprised of a projector whose light is reflected off a hemispherical mirror and onto a 36

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Projection de graphe"

1

Beck, D. M., M. J. Scott, S. F. Shindle, et al. Hanford Area 1990 population and 50-year projections. [Appendix contains computer programming for population projections and graphs showing them by grid areas]. Office of Scientific and Technical Information (OSTI), 1991. http://dx.doi.org/10.2172/5070450.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Tavella, Pilar, and Andrew Powell. Revelation of Expectations in Latin America (REVELA): Issue 24: September, 2012. Inter-American Development Bank, 2012. http://dx.doi.org/10.18235/0008079.

Full text

Abstract:

REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from central banks on a monthly basis to produce a report and a set of illustrative graphs and tables.

APA, Harvard, Vancouver, ISO, and other styles

3

Salazni, Mariana, and Andrew Powell. Revelation of Expectations in Latin America (REVELA): No. 12 : April, 2008. Inter-American Development Bank, 2008. http://dx.doi.org/10.18235/0008245.

Full text

Abstract:

REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. In this April issue, REVELA reports that growth expectations for 2008 on average remained almost

APA, Harvard, Vancouver, ISO, and other styles

4

Salazni, Mariana, and Andrew Powell. Revelation of Expectations in Latin America (REVELA): No. 10 : February, 2008. Inter-American Development Bank, 2008. http://dx.doi.org/10.18235/0008243.

Full text

Abstract:

REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. In this February issue, REVELA reports that growth expectations in Latin America for 2008 remain

APA, Harvard, Vancouver, ISO, and other styles

5

Salazni, Mariana, and Andrew Powell. Revelation of Expectations in Latin America (REVELA): No. 9 : January, 2008. Inter-American Development Bank, 2008. http://dx.doi.org/10.18235/0008260.

Full text

Abstract:

REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. In this January issue, REVELA reports that growth expectations in Latin America for 2008 were sta

APA, Harvard, Vancouver, ISO, and other styles

6

Salazni, Mariana, and Andrew Powell. Revelation of Expectations in Latin America (REVELA): No. 11 : March, 2008. Inter-American Development Bank, 2008. http://dx.doi.org/10.18235/0008244.

Full text

Abstract:

REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. In this March issue, REVELA reports that although growth expectations in Latin America for 2008 r

APA, Harvard, Vancouver, ISO, and other styles

7

Pinzon, Mauricio, and Arturo Galindo. Revelation of Expectations in Latin America (REVELA): No. 17 : September, 2008. Inter-American Development Bank, 2008. http://dx.doi.org/10.18235/0008250.

Full text

Abstract:

REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. The September issue of REVELA reports that growth expectations for 2008 are almost unchanged with

APA, Harvard, Vancouver, ISO, and other styles

8

Galindo, Arturo, and Mauricio Pinzon. Revelation of Expectations in Latin America (REVELA): No. 23 : March, 2009. Inter-American Development Bank, 2009. http://dx.doi.org/10.18235/0008255.

Full text

Abstract:

REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. In this March issue, REVELA reports that growth expectations for 2009 decreased with respect to l

APA, Harvard, Vancouver, ISO, and other styles

9

Salazni, Mariana, Andrew Powell, Mauricio Pinzon, and Arturo Galindo. Revelation of Expectations in Latin America (REVELA): No. 16 : August, 2008. Inter-American Development Bank, 2008. http://dx.doi.org/10.18235/0008249.

Full text

Abstract:

REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. In this August issue, REVELA reports that growth expectations for 2008 are almost unchanged with

APA, Harvard, Vancouver, ISO, and other styles

10

Pinzon, Mauricio, and Arturo Galindo. Revelation of Expectations in Latin America (REVELA): No. 21 : January, 2009. Inter-American Development Bank, 2009. http://dx.doi.org/10.18235/0008253.

Full text

Abstract:

REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. In this January issue, REVELA reports that growth expectations for 2009 decreased with respect to

APA, Harvard, Vancouver, ISO, and other styles

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!