Academic literature on the topic 'Séquences discrètes'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Séquences discrètes.'
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 "Séquences discrètes"
Clément, Pierre, and Jean Pelletier. "Le mont Mégantic (Québec) : essai de mise au point géomorphologique." Géographie physique et Quaternaire 34, no. 2 (January 28, 2011): 175–85. http://dx.doi.org/10.7202/1000396ar.
Full textVaudour, Jean. "Évolution holocène des travertins de vallée dans le Midi méditéranéen français." Géographie physique et Quaternaire 48, no. 3 (November 23, 2007): 315–26. http://dx.doi.org/10.7202/033012ar.
Full textDissertations / Theses on the topic "Séquences discrètes"
Queiros, Julie. "Analyse des réseaux d'ordre supérieur consruits à partir de séquences historio-géographiques." Electronic Thesis or Diss., Nantes Université, 2024. http://www.theses.fr/2024NANU4018.
Full textNetwork analysis extracts information about a system from the relationships between its actors. These relationships can correspond to flows drawn from sequences of states (i.e. agent trajectories between these entities). Representing these data as graphs generally assumes that these trajectories respect the Markov property; only the current state is sufficient to determine an agent’s future state. Numerous studies have challenged this assumption and proposed other models that allow us to overcome it: higher-order networks or HON. In it, a state can be represented by different memory nodes encoding the states previously visited before arriving at the current state. A first problem addressed in this thesis is the construction of HON, which is a statistical modeling problem: finding a good compromise between model size and quality. We propose here a model of variable-order networks that is more parsimonious than ex- isting models. A second problem is the analysis of HON. An advantage often put forward is that classical graph algorithms can be used with few modifications. We show, in the case of centrality measures or graph clustering, that this is not the case and argue that algorithms should be adapted to models
Cénac, Peggy. "Récursivité au carrefour de la modélisation de séquences, des arbres aléatoires, des algorithmes stochastiques et des martingales." Habilitation à diriger des recherches, Université de Bourgogne, 2013. http://tel.archives-ouvertes.fr/tel-00954528.
Full textBook chapters on the topic "Séquences discrètes"
Ghio, Alain, and Brigitte Bigi. "Introduction aux statistiques en sciences du langage." In Introduction aux statistiques en sciences du langage, 20–52. Dunod, 2023. http://dx.doi.org/10.3917/dunod.solie.2023.01.0020.
Full text