Auswahl der wissenschaftlichen Literatur zum Thema „Converse de la théorie de l'information“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Converse de la théorie de l'information" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Converse de la théorie de l'information"
Granger, Thierry. „Le renouveau de la théorie des organisations. Lecture critique de trois ouvrages récents“. Revue économique 48, Nr. 1 (01.01.1997): 147–80. http://dx.doi.org/10.3917/reco.p1997.48n1.0147.
Der volle Inhalt der QuelleCourtault, Jean-Michel. „Économétrie du portefeuille : l'approche de l'information“. Recherches économiques de Louvain 60, Nr. 2 (Juni 1994): 211–48. http://dx.doi.org/10.1017/s0770451800005807.
Der volle Inhalt der QuelleGodron, Michel, Jacques Poissonet und Philippe Daget. „Evaluer la diversité du paysage des pâturages africains“. Revue d’élevage et de médecine vétérinaire des pays tropicaux 52, Nr. 3-4 (01.03.1999): 272–77. http://dx.doi.org/10.19182/remvt.9676.
Der volle Inhalt der QuelleGarnham, Nicholas. „La théorie de la société de l'information en tant qu'idéologie : une critique“. Réseaux 18, Nr. 101 (2000): 53–91. http://dx.doi.org/10.3406/reso.2000.2245.
Der volle Inhalt der QuelleWalter, Christian. „Une Histoire du Concept D'Efficience Sur Les Marchés Financiers“. Annales. Histoire, Sciences Sociales 51, Nr. 4 (August 1996): 873–905. http://dx.doi.org/10.3406/ahess.1996.410892.
Der volle Inhalt der QuelleAires, Filipe, Alain Chédin und Jean-Pierre Nadal. „Analyse de séries temporelles géophysiques et théorie de l'information: L'analyse en composantes indépendantes“. Comptes Rendus de l'Académie des Sciences - Series IIA - Earth and Planetary Science 328, Nr. 9 (Mai 1999): 569–75. http://dx.doi.org/10.1016/s1251-8050(99)80152-9.
Der volle Inhalt der QuelleBillot, Antoine, und Jacques-François Thisse. „Modèles de choix individuels discrets : théorie et applications à la micro-économie.“ Revue économique 46, Nr. 3 (01.05.1995): 921–31. http://dx.doi.org/10.3917/reco.p1995.46n3.0921.
Der volle Inhalt der QuelleGdoura, Wahid. „Tendances de la recherche nord-africaine en science de l'information : entre théorie et application“. Documentaliste-Sciences de l'Information 45, Nr. 3 (2008): 4. http://dx.doi.org/10.3917/docsi.453.0004.
Der volle Inhalt der QuelleJulien, Pierre-André. „Entrepreneuriat, développement du territoire et appropriation de l'information“. Revue internationale P.M.E. 9, Nr. 3-4 (16.02.2012): 149–78. http://dx.doi.org/10.7202/1008271ar.
Der volle Inhalt der QuelleNAKOU, Zinsou Daniel, und Serge Francis SIMEN NANA. „Leadership participatif et identification organisationnelle : rôle médiateur de la responsabilité sociale des entreprises perçue par les employés et la fierté d’être membre dans les petites et moyennes entreprises béninoises“. International Journal of Financial Accountability, Economics, Management, and Auditing (IJFAEMA) 3, Nr. 3 (28.06.2021): 204–24. http://dx.doi.org/10.52502/ijfaema.v3i3.88.
Der volle Inhalt der QuelleDissertationen zum Thema "Converse de la théorie de l'information"
Marsiglietti, Arnaud. „Géométrie des mesures convexes et liens avec la théorie de l’information“. Thesis, Paris Est, 2014. http://www.theses.fr/2014PEST1032/document.
Der volle Inhalt der QuelleThis thesis is devoted to the study of convex measures as well as the relationships between the Brunn-Minkowski theory and the Information theory. I pursue the works by Costa and Cover who highlighted similarities between two fundamentals inequalities in the Brunn-Minkowski theory and in the Information theory. Starting with these similarities, they conjectured, as an analogue of the concavity of entropy power, that the n-th root of the parallel volume of every compact subset of $R^n$ is concave, and I give a complete answer to this conjecture. On the other hand, I study the convex measures defined by Borell and I established for these measures a refined inequality of the Brunn-Minkowski type if restricted to convex symmetric sets. This thesis is split in four parts. First, I recall some basic facts. In a second part, I prove the validity of the conjecture of Costa-Cover under special conditions and I show that the conjecture is false in such a generality by giving explicit counterexamples. In a third part, I extend the positive results of this conjecture by extending the notion of the classical volume and by establishing functional versions. Finally, I generalize recent works of Gardner and Zvavitch by improving the concavity of convex measures under different kind of hypothesis such as symmetries
Brunero, Federico. „Unearthing the Impact of Structure in Data and in Topology for Caching and Computing Networks“. Electronic Thesis or Diss., Sorbonne université, 2022. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2022SORUS368.pdf.
Der volle Inhalt der QuelleCaching has shown to be an excellent expedient for the purposes of reducing the traffic load in data networks. An information-theoretic study of caching, known as coded caching, represented a key breakthrough in understanding how memory can be effectively transformed into data rates. Coded caching also revealed the deep connection between caching and computing networks, which similarly show the same need for novel algorithmic solutions to reduce the traffic load. Despite the vast literature, there remain some fundamental limitations, whose resolution is critical. For instance, it is well-known that the coding gain ensured by coded caching not only is merely linear in the overall caching resources, but also turns out to be the Achilles heel of the technique in most practical settings. This thesis aims at improving and deepening the understanding of the key role that structure plays either in data or in topology for caching and computing networks. First, we explore the fundamental limits of caching under some information-theoretic models that impose structure in data, where by this we mean that we assume to know in advance what data are of interest to whom. Secondly, we investigate the impressive ramifications of having structure in network topology. Throughout the manuscript, we also show how the results in caching can be employed in the context of distributed computing
Hu, Xu. „Towards efficient learning of graphical models and neural networks with variational techniques“. Thesis, Paris Est, 2019. http://www.theses.fr/2019PESC1037.
Der volle Inhalt der QuelleIn this thesis, I will mainly focus on variational inference and probabilistic models. In particular, I will cover several projects I have been working on during my PhD about improving the efficiency of AI/ML systems with variational techniques. The thesis consists of two parts. In the first part, the computational efficiency of probabilistic graphical models is studied. In the second part, several problems of learning deep neural networks are investigated, which are related to either energy efficiency or sample efficiency
Calzolari, Giacomo. „Essais en théorie de l'information“. Toulouse 1, 2000. http://www.theses.fr/2000TOU10070.
Der volle Inhalt der QuelleGrinbaum, Alexei. „Le rôle de l'information dans la théorie quantique“. Phd thesis, Ecole Polytechnique X, 2004. http://tel.archives-ouvertes.fr/tel-00007634.
Der volle Inhalt der QuelleKaced, Tarik. „Partage de secret et théorie algorithmique de l'information“. Thesis, Montpellier 2, 2012. http://www.theses.fr/2012MON20170/document.
Der volle Inhalt der QuelleOur work deals with secret sharing in the theoretical point of views of Shannon's Information Theory and Kolmogorov's Algorithmic Information Theory. We are going to explain how these three subjects are naturally deeply intertwined.Information inequalities play a central role in this text. They are the inequalities for Shannon entropy, but also they are in exact correspondence with the inequalities for Kolmogorov complexity. Kolmogorov complexity formalizes the idea of randomness for strings.These two reasons alone justify to consider the notion of secret sharing in the Algorithmic framework (if one can share a random secret one can share anything).Originally, secret sharing was first studied under the combinatorial lens, only later was it more generally formalized using information-theoretic measures. This step allowed the use of information inequalities which revealed to bevery important to understand the existence of secret-sharing schemes with respect to efficiency.The investigation of information inequalities is at its debut. We contribute to the subject by introducing the notion of essentially conditional inequalities, which shows once again that information inequalities are yet not fully understood
Nechita, Ion. „États aléatoires, théorie quantique de l'information et probabilités libres“. Phd thesis, Université Claude Bernard - Lyon I, 2009. http://tel.archives-ouvertes.fr/tel-00371592.
Der volle Inhalt der QuelleGarivier, Aurélien. „Modèles contextuels et alphabets infinis en théorie de l'information“. Paris 11, 2006. http://www.theses.fr/2006PA112192.
Der volle Inhalt der QuelleThis thesis explores some contemporary aspects of information theory, from source coding to issues of model selection. We first consider the problem of coding memoryless sources on a countable, infinite alphabet. As it is impossible to provide a solution which is both efficient and general, two approaches are considered: we first establish conditions under which the entropic rate can be reached, and we consider restricted classes for which tail probabilities are controlled. The second approach does not set any condition on the sources but provides a partial solution by coding only a part of the information - the pattern - which captures the repetitions in the message. In order to study more complex processes, we come back to the case of finite memory sources on a finite alphabet : it has given rise to many works and efficient algorithms like the Context Tree Weighting (CTW) Method. We show here that this method is also efficient on anon-parametric class of infinite memory sources: the renewal processes. We show then that the ideas on which CTW is based lead to a consistent estimator of the memory structure of a process, when this structure is finite. In fact, we complete the study of the BIC context tree estimator for Variable Length Markov Chains. In the last part, it is shown how similar ideas can be generalized for more complex sources on a (countable or not) infinite alphabet. We obtain consistent estimators for the order of hidden Markov models with Poisson and Gaussian emission
Dion, Emmanuel. „La théorie de l'information appliquée à l'enquête par questionnaire“. Clermont-Ferrand 1, 1995. http://www.theses.fr/1995CLF10157.
Der volle Inhalt der QuelleInformations measurement as defined by information theory (particularly entropy, equivocation, ambiguity, capacity, redundancy and transmitted information) proposes a new series of tools for the evaluation of survey questionnaires. These tools make it possible to measure the amount of information one can get from each surveyed person, and established general questionnaire design rules that lead to the optimization of this amount of information
Bensadon, Jérémy. „Applications de la théorie de l'information à l'apprentissage statistique“. Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS025/document.
Der volle Inhalt der QuelleWe study two different topics, using insight from information theory in both cases: 1) Context Tree Weighting is a text compression algorithm that efficiently computes the Bayesian combination of all visible Markov models: we build a "context tree", with deeper nodes corresponding to more complex models, and the mixture is computed recursively, starting with the leaves. We extend this idea to a more general context, also encompassing density estimation and regression; and we investigate the benefits of replacing regular Bayesian inference with switch distributions, which put a prior on sequences of models instead of models. 2) Information Geometric Optimization (IGO) is a general framework for black box optimization that recovers several state of the art algorithms, such as CMA-ES and xNES. The initial problem is transferred to a Riemannian manifold, yielding parametrization-invariant first order differential equation. However, since in practice, time is discretized, this invariance only holds up to first order. We introduce the Geodesic IGO (GIGO) update, which uses this Riemannian manifold structure to define a fully parametrization invariant algorithm. Thanks to Noether's theorem, we obtain a first order differential equation satisfied by the geodesics of the statistical manifold of Gaussians, thus allowing to compute the corresponding GIGO update. Finally, we show that while GIGO and xNES are different in general, it is possible to define a new "almost parametrization-invariant" algorithm, Blockwise GIGO, that recovers xNES from abstract principles
Bücher zum Thema "Converse de la théorie de l'information"
La théorie de l'information: Roman. Paris]: Gallimard, 2012.
Den vollen Inhalt der Quelle findenLa science et la théorie de l'information. Sceaux: Gabay, 1988.
Den vollen Inhalt der Quelle findenApothéloz, Bernard. Maîtriser l'information comptable: Théorie comptable et applications avancées. Lausanne: Presses Polytechniques Romandes, 1987.
Den vollen Inhalt der Quelle findenVincent, Gripon, Hrsg. Petite mathématique du cerveau: Une théorie de l'information mentale. Paris: Odile Jacob, 2012.
Den vollen Inhalt der Quelle findenSpataru, Alexandru. Fondements de la théorie de la transmission de l'information. Lausanne: Presses Polytechniques Romandes, 1987.
Den vollen Inhalt der Quelle findenJaffelin, Jacques. Le promeneur d'Einstein: Vers une théorie de l'information générale. Montréal: Méridien, 1991.
Den vollen Inhalt der Quelle finden1945-, Kunt M., Hrsg. Traitement de l'information. Lausanne: Presses polytechniques et universitaires romandes, 1991.
Den vollen Inhalt der Quelle findenAuger, François. Introduction à la théorie du signal et de l'information: Cours et exercices. Paris: Editions Technip, 1999.
Den vollen Inhalt der Quelle findenGagnon, Philippe. Christianisme et théorie de l'information: Science et théologie dansl'œvre de Claude Tresmontant. Paris: Francois-Xavier de Guibert, 1998.
Den vollen Inhalt der Quelle findenJocas, Yves de. Théorie générale de l'information: Assises formelles du savoir et de la connaissance. Montréal: Éditions Logiques, 1996.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Converse de la théorie de l'information"
de FéRiet, Joseph Kampé. „La ThéOrie de L'Information et la MéCanique Statistique Classique des SystèMes en éQuilibre“. In Dinamica dei gas rarefatti, 155–222. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-11024-5_3.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Converse de la théorie de l'information"
Léon, J. „Théorie de l'information, information et linguistes français dans les années 1960. Un exemple de transfert entre mathématiques et sciences du langage“. In Congrès Mondial de Linguistique Française 2008. Les Ulis, France: EDP Sciences, 2008. http://dx.doi.org/10.1051/cmlf08142.
Der volle Inhalt der Quelle