Littérature scientifique sur le sujet « Projection de graphe »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Projection de graphe ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Projection de graphe"
Mezroui, Yahya. « Projection orthogonale sur le graphe d’une relation linéaire fermé ». Transactions of the American Mathematical Society 352, no 6 (15 décembre 1999) : 2789–800. http://dx.doi.org/10.1090/s0002-9947-99-02410-1.
Texte intégralLedermann, Florian. « Classifying Cartographic Projections Based on Dynamic Analysis of Program Code ». Abstracts of the ICA 2 (9 octobre 2020) : 1. http://dx.doi.org/10.5194/ica-abs-2-38-2020.
Texte intégralDilworth, Stephen J., Denka Kutzarova et Mikhail I. Ostrovskii. « Lipschitz-free Spaces on Finite Metric Spaces ». Canadian Journal of Mathematics 72, no 3 (13 février 2019) : 774–804. http://dx.doi.org/10.4153/s0008414x19000087.
Texte intégralBae, Yeolhui, Yugyeom Yi, Jeongmoo Lee et Sungmo Kang. « Research on Definition of BLL Graphs of Knot Diagrams and its Applications ». Korean Science Education Society for the Gifted 14, no 3 (30 décembre 2022) : 229–36. http://dx.doi.org/10.29306/jseg.2022.14.3.229.
Texte intégralLarose, Benoit. « Strongly Projective Graphs ». Canadian Journal of Mathematics 54, no 4 (1 août 2002) : 757–68. http://dx.doi.org/10.4153/cjm-2002-029-7.
Texte intégralKaliszewski, S., Alex Kumjian, John Quigg et Aidan Sims. « Topological realizations and fundamental groups of higher-rank graphs ». Proceedings of the Edinburgh Mathematical Society 59, no 1 (10 juin 2015) : 143–68. http://dx.doi.org/10.1017/s0013091515000061.
Texte intégralNIKKUNI, RYO. « COMPLETELY DISTINGUISHABLE PROJECTIONS OF SPATIAL GRAPHS ». Journal of Knot Theory and Its Ramifications 15, no 01 (janvier 2006) : 11–19. http://dx.doi.org/10.1142/s0218216506004282.
Texte intégralHUH, YOUNGSIK. « AN ELEMENTARY SET FOR EMBEDDED BOUQUET GRAPHS WITH TWO CYCLES ». Journal of Knot Theory and Its Ramifications 20, no 02 (février 2011) : 305–25. http://dx.doi.org/10.1142/s0218216511008796.
Texte intégralFilippova, 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 (1 février 2022) : 235–67. http://dx.doi.org/10.1070/sm9519.
Texte intégralHUH, YOUNGSIK, et KOUKI TANIYAMA. « IDENTIFIABLE PROJECTIONS OF SPATIAL GRAPHS ». Journal of Knot Theory and Its Ramifications 13, no 08 (décembre 2004) : 991–98. http://dx.doi.org/10.1142/s0218216504003640.
Texte intégralThèses sur le sujet "Projection de graphe"
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.
Texte intégralThis thesis studies the problem of privacy in linked open data (LOD). Thiswork is at the intersection of long lines of work on data privacy and linked open data.Our goal is to study how the presence of semantics impacts the publication of data andpossible data leaks. We consider RDF as the format to represent LOD and DifferentialPrivacy (DP) as the main privacy concept. DP was initially conceived to define privacyin the relational database (RDB) domain and is based on a quantification of the difficultyfor an attacker observing an output to identify which database among a neighborhoodis used to produce it.The objective of this thesis is four-fold: O1) to improve the privacy of LOD. Inparticular, to propose an approach to construct usable DP-mechanisms on RDF; O2) tostudy how neighborhood definitions over RDB in the presence of foreign key (FK) constraints translate to RDF; O3) to propose new neighborhood definitions over relationaldatabase translating into existing graph concepts to ease the design of DP mechanisms;and O4) to support the implementation of sanitization mechanisms for RDF graphs witha rigorous formal foundation.For O1, we propose a novel approach based on graph projection to adapt DP toRDF. For O2, we determine the privacy model resulting from the translation of popularprivacy model over RDB with FK constraints to RDF. For O3, we propose the restrictdeletion neighborhood over RDB with FK constraints whose translation to the RDFgraph world is equivalent to typed-node neighborhood. Moreover, we propose a looserdefinition translating to typed-outedge neighborhood. For O4, we propose a graphtransformation language based on graph rewriting to serve as a basis for constructingvarious sanitization mechanisms on attributed graphs.We support all our theoretical contributions with proof-of-concept prototypes thatimplement our proposals and are evaluated on real datasets to show the applicability ofour work
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.
Texte intégralPhan, 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.
Texte intégralCryo-electron microscopy is a tomographic technique allowing to reconstruct a 3D model of complex structure in biology from a set of acquired images. These images are known as the tomographic projections and are taken at unknown directions. The advantage of the cryo-electron microscopy is the 3D reconstruction at very high resolution. The reconstruction procedure consists of many steps such as projection alignment, projection classification, orientation estimation and projection refinement. During these steps, the distance between two projections is frequently measured. The work in this thesis aims at studying the distances mesured between two unknown-direction projections with the objective of improving the reconstruction result in the cryo-electron microscopy. The contribution of this thesis is the developement of a method for estimating the angular difference between two projections in 2D and 3D. Our method is based on the construction of a neighborhood graph whose vertices are the projections, whose edges link the projection neighbors and are weighted by a local approximation of the angular difference. The calculation of the weights relies on the projection moment properties. The proposed method has been tested on simulated images with different resolutions and at different noise levels. The comparison with others estimation methods of angular difference has been realised
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.
Texte intégralIn this thesis, we study two main problems in graph theory: homomorphism problem of planar (signed) graphs and Hamiltonian cycle problem.As an extension of the Four-Color Theorem, it is conjectured ([80],[41]) that every planar consistent signed graph of unbalanced-girth d+1(d>1) admits a homomorphism to signed projective cube SPC(d) of dimension d. It is naturally asked that:Is SPC(d) an optimal bound of unbalanced-girth d+1 for all planar consistent signed graphs of unbalanced-girth d+1?In Chapter 2, we prove that: if (B,Ω) is a consistent signed graph of unbalanced-girth d which bounds the class of consistent signed planar graphs of unbalanced-girth d, then |B|≥2^{d-1}. Furthermore,if no subgraph of (B,Ω) bounds the same class, δ(B)≥d, and therefore,|E(B)|≥d·2^{d-2}.Our result shows that if the conjecture above holds, then the SPC(d) is an optimal bound both in terms of number of vertices and number of edges.When d=2k, the problem is equivalent to the homomorphisms of graphs: isPC(2k) an optimal bound of odd-girth 2k+1 for P_{2k+1}(the class of all planar graphs of odd-girth at least 2k+1)? Note that K_4-minor free graphs are planar graphs, is PC(2k) also an optimal bound of odd-girth 2k+1 for all K_4-minor free graphs of odd-girth 2k+1 ? The answer is negative, in [6], a family of graphs of order O(k^2) bounding the K_4-minor free graphs of odd-girth 2k+1 were given. Is this an optimal bound? In Chapter 3, we prove that: if B is a graph of odd-girth 2k+1 which bounds all the K_4-minor free graphs of odd-girth 2k+1,then |B|≥(k+1)(k+2)/2. Our result together with the result in [6] shows that order O(k^2) is optimal.Furthermore, if PC(2k) bounds P_{2k+1},then PC(2k) also bounds P_{2r+1}(r>k). However, in this case we believe that a proper subgraph of PC(2k) would suffice to bound P_{2r+1}, then what’s the optimal subgraph of PC(2k) that bounds P_{2r+1}? The first case of this problem which is not studied is k=3 and r=5. For this case, Naserasr [81] conjectured that the Coxeter graph bounds P_{11} . Supporting this conjecture, in Chapter 4, we prove that the Coxeter graph bounds P_{17}.In Chapter 5,6, we study the Hamiltonian cycle problems. Dirac showed in 1952that every graph of order n is Hamiltonian if any vertex is of degree at least n/2. This result started a new approach to develop sufficient conditions on degrees for a graph to be Hamiltonian. Many results have been obtained in generalization of Dirac’s theorem. In the results to strengthen Dirac’s theorem, there is an interesting research area: to control the placement of a set of vertices on a Hamiltonian cycle such that thesevertices have some certain distances among them on the Hamiltonian cycle.In this thesis, we consider two related conjectures, one is given by Enomoto: if G is a graph of order n≥3, and δ(G)≥n/2+1, then for any pair of vertices x, y in G, there is a Hamiltonian cycle C of G such that dist_C(x, y)=n/2. Motivated by this conjecture, it is proved,in [32],that a pair of vertices are located at distances no more than n/6 on a Hamiltonian cycle. In [33], the cases δ(G) ≥(n+k)/2 are considered, it is proved that a pair of vertices can be located at any given distance from 2 to k on a Hamiltonian cycle. Moreover, Faudree and Li proposed a more general conjecture: if G is a graph of order n≥3, and δ(G)≥n/2+1, then for any pair of vertices x, y in G andany integer 2≤k≤n/2, there is a Hamiltonian cycle C of G such that dist_C(x, y) = k. Using Regularity Lemma and Blow-up Lemma, in Chapter 5, we give a proof ofEnomoto’s conjecture for graphs of sufficiently large order, and in Chapter 6, we give a proof of Faudree and Li’s conjecture for graphs of sufficiently large order
Douar, Brahim. « Fouille de sous-graphes fréquents à base d'arc consistance ». Thesis, Montpellier 2, 2012. http://www.theses.fr/2012MON20108/document.
Texte intégralWith the important growth of requirements to analyze large amount of structured data such as chemical compounds, proteins structures, social networks, to cite but a few, graph mining has become an attractive track and a real challenge in the data mining field. Because of the NP-Completeness of subgraph isomorphism test as well as the huge search space, frequent subgraph miners are exponential in runtime and/or memory use. In order to alleviate the complexity issue, existing subgraph miners have explored techniques based on the minimal support threshold, the description language of the examples (only supporting paths, trees, etc.) or hypothesis (search for shared trees or common paths, etc.). In this thesis, we are using a new projection operator, named AC-projection, which exhibits nice complexity properties as opposed to the graph isomorphism operator. This operator comes from the constraints programming field and has the advantage of a polynomial complexity. We propose two frequent subgraph mining algorithms based on the latter operator. The first one, named FGMAC, follows a breadth-first order to find frequent subgraphs and takes advantage of the well-known Apriori levelwise strategy. The second is a pattern-growth approach that follows a depth-first search space exploration strategy and uses powerful pruning techniques in order to considerably reduce this search space. These two approaches extract a set of particular subgraphs named AC-reduced frequent subgraphs. As a first step, we have studied the search space for discovering such frequent subgraphs and proved that this one is smaller than the search space of frequent isomorphic subgraphs. Then, we carried out experiments in order to prove that FGMAC and AC-miner are more efficient than the state-of-the-art algorithms. In the same time, we have studied the relevance of frequent AC-reduced subgraphs, which are much fewer than isomorphic ones, on classification and we conclude that we can achieve an important performance gain without or with non-significant loss of discovered pattern's quality
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.
Texte intégralDelhommé, Christian. « Propriétés de projection ». Lyon 1, 1995. http://www.theses.fr/1995LYO10159.
Texte intégralHansen, Bret. « Graphic Design as Projection ». VCU Scholars Compass, 2010. http://scholarscompass.vcu.edu/etd/2117.
Texte intégralTsukamoto, Tatsuya. « Knot-inevitable projections of planar graphs / ». Electronic version of summary, 1999. http://www.wul.waseda.ac.jp/gakui/gaiyo/2870.pdf.
Texte intégralLuqman, Muhammad Muzzamil. « Fuzzy multilevel graph embedding for recognition, indexing and retrieval of graphic document images ». Thesis, Tours, 2012. http://www.theses.fr/2012TOUR4005/document.
Texte intégralThis thesis addresses the problem of lack of efficient computational tools for graph based structural pattern recognition approaches and proposes to exploit computational strength of statistical pattern recognition. It has two fold contributions. The first contribution is a new method of explicit graph embedding. The proposed graph embedding method exploits multilevel analysis of graph for extracting graph level information, structural level information and elementary level information from graphs. It embeds this information into a numeric feature vector. The method employs fuzzy overlapping trapezoidal intervals for addressing the noise sensitivity of graph representations and for minimizing the information loss while mapping from continuous graph space to discrete vector space. The method has unsupervised learning abilities and is capable of automatically adapting its parameters to underlying graph dataset. The second contribution is a framework for automatic indexing of graph repositories for graph retrieval and subgraph spotting. This framework exploits explicit graph embedding for representing the cliques of order 2 by numeric feature vectors, together with classification and clustering tools for automatically indexing a graph repository. It does not require a labeled learning set and can be easily deployed to a range of application domains, offering ease of query by example (QBE) and granularity of focused retrieval
Livres sur le sujet "Projection de graphe"
Hemispherical projection methods in rock mechanics. London : Allen & Unwin, 1985.
Trouver le texte intégralShepherd, Angela. Australian wine grape production and winery intake : Projections to 2002-03. Canberra : ABARE, 2000.
Trouver le texte intégralProjective graphics : The first album. London : Hertfordshire Press, 2014.
Trouver le texte intégralAli, Abdalla, et Australian Bureau of Agricultural and Resource Economics., dir. Wine grapes : Projections of wine grape production and winery intake to 1994-95. Canberra : Australian Bureau of Agricultural and Resource Economics, 1992.
Trouver le texte intégralGuriev, T. S. Trimetricheskie proekt͡s︡ii. Moskva : "Nedra", 1992.
Trouver le texte intégralSal'kov, Nikolay. Descriptive geometry. ru : INFRA-M Academic Publishing LLC., 2022. http://dx.doi.org/10.12737/1874094.
Texte intégralRodin, Esquejo, et Alphona Adrian, dir. Mind the gap : Intimate strangers. Berkeley, Calif : Image Comics, 2012.
Trouver le texte intégralDunn, 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. Ottawa, Ont : Patrimoine canadien, Parcs Canada, 1994.
Trouver le texte intégral1624-1683, Guarini Guarino, et Università di Roma. Dipartimento di rilievo, analisi, disegno dell'ambiente e dell'architettura., dir. La scienza della rappresentazione nella concezione di Guarino Guarini. Roma : Gangemi, 2008.
Trouver le texte intégralShades of Simon Gray. New York : Delacorte Press, 2001.
Trouver le texte intégralChapitres de livres sur le sujet "Projection de graphe"
Falb, Peter. « Projective Algebraic Geometry III : Products, Graphs, Projections ». Dans Methods of Algebraic Geometry in Control Theory : Part II, 173–80. Boston, MA : Birkhäuser Boston, 1999. http://dx.doi.org/10.1007/978-1-4612-1564-6_11.
Texte intégralFalb, Peter. « Projective Algebraic Geometry III : Products, Graphs, Projections ». Dans Methods of Algebraic Geometry in Control Theory : Part II, 173–80. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96574-1_10.
Texte intégralYarwood, A. « Orthographic Projection ». Dans Work Out Graphic Communication GCSE, 33–49. London : Macmillan Education UK, 1988. http://dx.doi.org/10.1007/978-1-349-10242-6_3.
Texte intégralvan Wyk, Barend Jacobus, Michaël Antonie van Wyk et Hubert Edward Hanrahan. « Successive Projection Graph Matching ». Dans Lecture Notes in Computer Science, 263–71. Berlin, Heidelberg : Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-70659-3_27.
Texte intégralAravind, N. R., et Udit Maniyar. « Planar Projections of Graphs ». Dans Algorithms and Discrete Applied Mathematics, 453–62. Cham : Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39219-2_36.
Texte intégralBose, Prosenjit, Pedro Ramos, Francisco Gomez et Godfried Toussaint. « Drawing nice projections of objects in space ». Dans Graph Drawing, 52–63. Berlin, Heidelberg : Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0021790.
Texte intégralHusák, Martin, Joseph Khoury, Đorđe Klisura et Elias Bou-Harb. « On the Provision of Network-Wide Cyber Situational Awareness via Graph-Based Analytics ». Dans Complex Computational Ecosystems, 167–79. Cham : Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-44355-8_12.
Texte intégralDwyer, Tim, et George Robertson. « Layout with Circular and Other Non-linear Constraints Using Procrustes Projection ». Dans Graph Drawing, 393–404. Berlin, Heidelberg : Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11805-0_37.
Texte intégralWillems, M. « Projection and unification for conceptual graphs ». Dans Conceptual Structures : Applications, Implementation and Theory, 278–92. Berlin, Heidelberg : Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60161-9_44.
Texte intégralde Ridder, H. N., et H. L. Bodlaender. « Graph automorphisms with maximal projection distances ». Dans Fundamentals of Computation Theory, 204–14. Berlin, Heidelberg : Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48321-7_16.
Texte intégralActes de conférences sur le sujet "Projection de graphe"
Liu, Hanyang, Junwei Han et Feiping Nie. « Semi-supervised Orthogonal Graph Embedding with Recursive Projections ». Dans Twenty-Sixth International Joint Conference on Artificial Intelligence. California : International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/321.
Texte intégralWilde, D. J. « Two Generalizations of the Isometric Projection in Geometric Design ». Dans ASME 1987 Design Technology Conferences. American Society of Mechanical Engineers, 1987. http://dx.doi.org/10.1115/detc1987-0045.
Texte intégralLu, Yueheng, Runjia Tian, Ao Li, Xiaoshi Wang et Garcia del Castillo Lopez Jose Luis. « CubiGraph5K - Organizational Graph Generation for Structured Architectural Floor Plan Dataset ». Dans CAADRIA 2021 : Projections. CAADRIA, 2021. http://dx.doi.org/10.52842/conf.caadria.2021.1.081.
Texte intégralShekhawat, Krishnendra. « A Graph Theoretic Approach for the Automated Generation of Dimensioned Floorplans ». Dans CAADRIA 2021 : Projections. CAADRIA, 2021. http://dx.doi.org/10.52842/conf.caadria.2021.1.141.
Texte intégralWan, Hai, Yonghao Luo, Bo Peng et Wei-Shi Zheng. « Representation Learning for Scene Graph Completion via Jointly Structural and Visual Embedding ». Dans Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California : International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/132.
Texte intégralMathieson, James L., et Joshua D. Summers. « Complexity Metrics for Directional Node-Link System Representations : Theory and Applications ». Dans ASME 2010 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/detc2010-28561.
Texte intégralEslami, Mohammed, George Zheng, Hamed Eramian et Georgiy Levchuk. « Deriving cyber use cases from graph projections of cyber data represented as bipartite graphs ». Dans 2017 IEEE International Conference on Big Data (Big Data). IEEE, 2017. http://dx.doi.org/10.1109/bigdata.2017.8258511.
Texte intégralHorvat, E.-A., et K. A. Zweig. « One-mode Projection of Multiplex Bipartite Graphs ». Dans 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012). IEEE, 2012. http://dx.doi.org/10.1109/asonam.2012.101.
Texte intégralAhmed, Nesreen, Nick Duffield et Liangzhen Xia. « Sampling for Approximate Bipartite Network Projection ». Dans Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California : International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/456.
Texte intégralWeng, Yulai, Andrew Specian et Mark Yim. « Low Cost Optical Mechanical System for Human Robot Interaction ». Dans ASME 2018 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/imece2018-87885.
Texte intégralRapports d'organisations sur le sujet "Projection de graphe"
Beck, D. M., M. J. Scott, S. F. Shindle, B. A. Napier, A. G. Thurman, N. C. Batishko, M. D. Davis et D. B. Pittenger. 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), octobre 1991. http://dx.doi.org/10.2172/5070450.
Texte intégralTavella, Pilar, et Andrew Powell. Revelation of Expectations in Latin America (REVELA) : Issue 24 : September, 2012. Inter-American Development Bank, septembre 2012. http://dx.doi.org/10.18235/0008079.
Texte intégralSalazni, Mariana, et Andrew Powell. Revelation of Expectations in Latin America (REVELA) : No. 12 : April, 2008. Inter-American Development Bank, avril 2008. http://dx.doi.org/10.18235/0008245.
Texte intégralSalazni, Mariana, et Andrew Powell. Revelation of Expectations in Latin America (REVELA) : No. 10 : February, 2008. Inter-American Development Bank, février 2008. http://dx.doi.org/10.18235/0008243.
Texte intégralSalazni, Mariana, et Andrew Powell. Revelation of Expectations in Latin America (REVELA) : No. 9 : January, 2008. Inter-American Development Bank, janvier 2008. http://dx.doi.org/10.18235/0008260.
Texte intégralSalazni, Mariana, et Andrew Powell. Revelation of Expectations in Latin America (REVELA) : No. 11 : March, 2008. Inter-American Development Bank, mars 2008. http://dx.doi.org/10.18235/0008244.
Texte intégralPinzon, Mauricio, et Arturo Galindo. Revelation of Expectations in Latin America (REVELA) : No. 17 : September, 2008. Inter-American Development Bank, septembre 2008. http://dx.doi.org/10.18235/0008250.
Texte intégralGalindo, Arturo, et Mauricio Pinzon. Revelation of Expectations in Latin America (REVELA) : No. 23 : March, 2009. Inter-American Development Bank, mars 2009. http://dx.doi.org/10.18235/0008255.
Texte intégralSalazni, Mariana, Andrew Powell, Mauricio Pinzon et Arturo Galindo. Revelation of Expectations in Latin America (REVELA) : No. 16 : August, 2008. Inter-American Development Bank, août 2008. http://dx.doi.org/10.18235/0008249.
Texte intégralPinzon, Mauricio, et Arturo Galindo. Revelation of Expectations in Latin America (REVELA) : No. 21 : January, 2009. Inter-American Development Bank, janvier 2009. http://dx.doi.org/10.18235/0008253.
Texte intégral