Relevant bibliographies by topics / Graph projection

Contents

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

Academic literature on the topic 'Graph projection'

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 'Graph projection.'

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 "Graph projection"

1

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
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

CAELLI, TERRY, and SERHIY KOSINOV. "INEXACT GRAPH MATCHING USING EIGEN-SUBSPACE PROJECTION CLUSTERING." International Journal of Pattern Recognition and Artificial Intelligence 18, no. 03 (2004): 329–54. http://dx.doi.org/10.1142/s0218001404003186.

Full text
Abstract:
Graph eigenspaces have been used to encode many different properties of graphs. In this paper we explore how such methods can be used for solving inexact graph matching (the matching of sets of vertices in one graph to those in another) having the same or different numbers of vertices. In this case we explore eigen-subspace projections and vertex clustering (EPS) methods. The correspondence algorithm enables the EPC method to discover a range of correspondence relationships from one-to-one vertex matching to that of inexact (many-to-many) matching of structurally similar subgraphs based on the
APA, Harvard, Vancouver, ISO, and other styles
4

Dal Col, Alcebiades, and Fabiano Petronetto. "Graph regularization multidimensional projection." Pattern Recognition 129 (September 2022): 108690. http://dx.doi.org/10.1016/j.patcog.2022.108690.

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

NIKKUNI, RYO, MAKOTO OZAWA, KOUKI TANIYAMA, and YUKIHIRO TSUTSUMI. "NEWLY FOUND FORBIDDEN GRAPHS FOR TRIVIALIZABILITY." Journal of Knot Theory and Its Ramifications 14, no. 04 (2005): 523–38. http://dx.doi.org/10.1142/s0218216505003932.

Full text
Abstract:
A planar graph is said to be trivializable if every regular projection of the graph produces a trivial spatial embedding by giving some over/under informations to the double points. Every minor of a trivializable graph is also trivializable, thus the set of forbidden graphs is finite. Seven forbidden graphs for the trivializability were previously known. In this paper, we exhibit nine more forbidden graphs.
APA, Harvard, Vancouver, ISO, and other styles
6

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
7

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
8

Douar, Brahim, Chiraz Latiri, Michel Liquiere, and Yahya Slimani. "A Projection Bias in Frequent Subgraph Mining Can Make a Difference." International Journal on Artificial Intelligence Tools 23, no. 05 (2014): 1450005. http://dx.doi.org/10.1142/s0218213014500055.

Full text
Abstract:
The aim of the frequent subgraph mining task is to find frequently occurring subgraphs in a large graph database. However, this task is a thriving challenge, as graph and subgraph isomorphisms play a key role throughout the computations. Since subgraph isomorphism testing is a hard problem, subgraph miners are exponential in runtime. To alleviate the complexity issue, we propose to introduce a bias in the projection operator and instead of using the costly subgraph isomorphism projection, one can use a polynomial projection having a semantically-valid structural interpretation. This paper pres
APA, Harvard, Vancouver, ISO, and other styles
9

Bach, Nguyen Gia, Chanh Minh Tran, Tho Nguyen Duc, Phan Xuan Tan, and Eiji Kamioka. "Novel Projection Schemes for Graph-Based Light Field Coding." Sensors 22, no. 13 (2022): 4948. http://dx.doi.org/10.3390/s22134948.

Full text
Abstract:
In light field compression, graph-based coding is powerful to exploit signal redundancy along irregular shapes and obtains good energy compaction. However, apart from high time complexity to process high dimensional graphs, their graph construction method is highly sensitive to the accuracy of disparity information between viewpoints. In real-world light field or synthetic light field generated by computer software, the use of disparity information for super-rays projection might suffer from inaccuracy due to vignetting effect and large disparity between views in the two types of light fields,
APA, Harvard, Vancouver, ISO, and other styles
10

Hjouj, Fawaz. "On Tomography with Unknown Orientation." Journal of Mathematical Sciences & Computer Applications 2, no. 2 (2017): 125–35. http://dx.doi.org/10.5147/jmsca.v2i1.99.

Full text
Abstract:
We consider the two-dimensional parallel beam Tomography problem in which both the object being imaged and the projection directions are unknown. The angles of projections need not to be uniformly distributed. Our solution combines two known approaches: the Geometric Moment and the Graph Laplacian. After sorting the projections using the Graph Laplacian method we create a one to one moment function of the angles. We then solve for each angle uniquely.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Graph projection"

1

Wu, Yingxin. "Hybrid multivariate network visualization combining dimensional projection and graph drawing." Thesis, The University of Sydney, 2008. https://hdl.handle.net/2123/28136.

Full text
Abstract:
The goal of information visualization is to transform abstract data into efficient visual format which help humans extract useful information from the data collected. Two distinctive types of data are of particular interest to the information visualization community: one is multidimensional data in which each data point/entity is described by various attributes. The other is relational data which represent the interaction between the entities. These two types of data are common in the real world but difficult for people to understand. Many visualization approaches have been developed to h
APA, Harvard, Vancouver, ISO, and other styles
2

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
3

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
4

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
5

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
6

Farkas, Ábel. "Dimension and measure theory of self-similar structures with no separation condition." Thesis, University of St Andrews, 2015. http://hdl.handle.net/10023/7854.

Full text
Abstract:
We introduce methods to cope with self-similar sets when we do not assume any separation condition. For a self-similar set K ⊆ ℝᵈ we establish a similarity dimension-like formula for Hausdorff dimension regardless of any separation condition. By the application of this result we deduce that the Hausdorff measure and Hausdorff content of K are equal, which implies that K is Ahlfors regular if and only if Hᵗ (K) > 0 where t = dim[sub]H K. We further show that if t = dim[sub]H K < 1 then Hᵗ (K) > 0 is also equivalent to the weak separation property. Regarding Hausdorff dimension, we give a dimens
APA, Harvard, Vancouver, ISO, and other styles
7

Kourtellis, Nicolas. "On the Design of Socially-Aware Distributed Systems." Scholar Commons, 2012. http://scholarcommons.usf.edu/etd/4107.

Full text
Abstract:
Social media services and applications enable billions of users to share an unprecedented amount of social information, which is further augmented by location and collocation information from mobile phones, and can be aggregated to provide an accurate digital representation of the social world. This dissertation argues that extracted social knowledge from this wealth of information can be embedded in the design of novel distributed, socially-aware applications and services, consequently improving system response time, availability and resilience to attacks, and reducing system overhead. To sup
APA, Harvard, Vancouver, ISO, and other styles
8

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
9

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&gt;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
10

Chu, Lei. "Colouring Cayley Graphs." Thesis, University of Waterloo, 2005. http://hdl.handle.net/10012/1125.

Full text
Abstract:
We will discuss three ways to bound the chromatic number on a Cayley graph. 1. If the connection set contains information about a smaller graph, then these two graphs are related. Using this information, we will show that Cayley graphs cannot have chromatic number three. 2. We will prove a general statement that all vertex-transitive maximal triangle-free graphs on <i>n</i> vertices with valency greater than <i>n</i>/3 are 3-colourable. Since Cayley graphs are vertex-transitive, the bound of general graphs also applies to Cayley graphs. 3. Since Cayley graphs for a
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Graph projection"

1

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
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

Alberto, Corso, and Polini Claudia 1966-, eds. Commutative algebra and its connections to geometry: Pan-American Advanced Studies Institute, August 3--14, 2009, Universidade Federal de Pernambuco, Olinda, Brazil. American Mathematical Society, 2011.

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

Coolen, A. C. C., A. Annibale, and E. S. Roberts. Applications of random graphs. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198709893.003.0011.

Full text
Abstract:
This chapter reviews graph generation techniques in the context of applications. The first case study is power grids, where proposed strategies to prevent blackouts have been tested on tailored random graphs. The second case study is in social networks. Applications of random graphs to social networks are extremely wide ranging – the particular aspect looked at here is modelling the spread of disease on a social network – and how a particular construction based on projecting from a bipartite graph successfully captures some of the clustering observed in real social networks. The third case stu
APA, Harvard, Vancouver, ISO, and other styles
5

Dicks, W. Groups, Trees and Projective Modules. Springer London, Limited, 2006.

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

Book chapters on the topic "Graph projection"

1

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
2

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
3

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
4

Zhu, Lei, Jingjing Li, and Zheng Zhang. "Dynamic Graph Learning for Feature Projection." In Dynamic Graph Learning for Dimension Reduction and Data Clustering. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-42313-0_2.

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

Soylu, Ahmet, and Evgeny Kharlamov. "Navigating OWL 2 Ontologies Through Graph Projection." In Metadata and Semantic Research. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-14401-2_10.

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

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
7

Fatemi, Bahareh, Soheila Molaei, Hadi Zare, and Shirui Pan. "Manifold Approximation and Projection by Maximizing Graph Information." In Advances in Knowledge Discovery and Data Mining. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-75768-7_11.

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

Yoshida, Tetsuya, and Kazuhiro Okatani. "A Graph-Based Projection Approach for Semi-supervised Clustering." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15037-1_1.

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

Ma, Xiangnan, Wenting Yu, Lin Zhu, and Luyi Bai. "Cross-Projection for Embedding Translation in Knowledge Graph Completion." In Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32591-6_20.

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

Douar, Brahim, Michel Liquiere, Chiraz Latiri, and Yahya Slimani. "Graph-Based Relational Learning with a Polynomial Time Projection Algorithm." In Inductive Logic Programming. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31951-8_13.

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

Conference papers on the topic "Graph projection"

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

Zhang, Zhaoyang, and Zheng Tian. "Image Registration Using Isometric Projection of Graph." In 2009 International Conference on Information Engineering and Computer Science. IEEE, 2009. http://dx.doi.org/10.1109/iciecs.2009.5363554.

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

Shang, Ming-Sheng, Yan Fu, and Duan-Bin Chen. "Personal Recommendation using Weighted Bipartite Graph Projection." In 2008 International Conference on Apperceiving Computing and Intelligence Analysis (ICACIA 2008). IEEE, 2008. http://dx.doi.org/10.1109/icacia.2008.4770004.

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

Weerasinghe, Thilina, Daniel Romero, Cesar Asensio-Marco, and Baltasar Beferull-Lozano. "Fast Distributed Subspace Projection via Graph Filters." In ICASSP 2018 - 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2018. http://dx.doi.org/10.1109/icassp.2018.8462110.

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

Futamura, Yasunori, Ryota Wakaki, and Tetsuya Sakurai. "Spectral Graph Partitioning Using Geodesic Distance-based Projection." In 2021 IEEE High Performance Extreme Computing Conference (HPEC). IEEE, 2021. http://dx.doi.org/10.1109/hpec49654.2021.9622831.

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

Topczewska, Magdalena, and Kurt Frischmuth. "Rank Regression by Projection Method vs Graph-Theoretical Algorithms." In 2008 7th Computer Information Systems and Industrial Management Applications (CISIM). IEEE, 2008. http://dx.doi.org/10.1109/cisim.2008.25.

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

Li, Bing C., and Lockheed Martin. "Graph and Projection Pursuits Approach for Time Frequency Analysis." In 2021 IEEE Radar Conference (RadarConf21). IEEE, 2021. http://dx.doi.org/10.1109/radarconf2147009.2021.9455233.

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

Ceylan, Oguzhan, and Gulsen Taskin. "Graph Optimized Locality Preserving Projection Via Heuristic Optimization Algorithms." In IGARSS 2019 - 2019 IEEE International Geoscience and Remote Sensing Symposium. IEEE, 2019. http://dx.doi.org/10.1109/igarss.2019.8900479.

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

Ma, Jun, and GuangXia Wang. "Construction and Intelligent Application of Map Projection Knowledge Graph." In 2022 International Conference on Intelligent Transportation, Big Data & Smart City (ICITBS). IEEE, 2022. http://dx.doi.org/10.1109/icitbs55627.2022.00026.

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

Reports on the topic "Graph projection"

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!

To the bibliography