Concept
P-adic valuation
Related publications (8)
Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics
A set is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every there exists a set , where $a_{1},\ldots ,a_ ...
2019The control of the scaled false discovery rate, a flexible and comprehensive error control and a powerful theoretical tool in multiple testing
Dimitri Nestor Alice Van De Ville, Stephan Morgenthaler, Djalel Eddine Meskaldji
Given the large number of papers written over the last ten years on error controls in high dimensional multiple testing, it would be worthwhile to consider a single comprehensive technique that allows user flexibility in error control when dealing with big ...
2015Utility Metrics Specifications. OpenIoT Deliverable D422
Jean Paul Calbimonte Perez, Mehdi Riahi
This deliverable specifies the utility metrics that are considered and used in the scope of the OpenIoT project. These utility metrics are recorded as part of the implementation of the Utility Manager component of the OpenIoT platform, while they have also ...
2014Spaces With Noetherian Cohomology
Is the cohomology of the classifying space of a p-compact group, with Noetherian twisted coefficients, a Noetherian module? In this paper we provide, over the ring of p-adic integers, such a generalization to p-compact groups of the Evens-Venkov Theorem. W ...
Cambridge University Press2013Some Thoughts on Robustness and Multiple Testing
Stephan Morgenthaler, Djalel Eddine Meskaldji
When testing many null hypotheses, deciding which of them to reject is a subtle game. The prevailing approach consists in deciding on a level and type of control against false rejections (errors of type I) and subject to this constraint to maximize the num ...
2012Adaptive Strategy for the Statistical Analysis of Connectomes
Jean-Philippe Thiran, Stephan Morgenthaler, Reto Meuli, Patric Hagmann, Djalel Eddine Meskaldji, Leila Cammoun
We study an adaptive statistical approach to analyze brain networks represented by brain connection matrices of interregional connectivity (connectomes). Our approach is at a middle level between a global analysis and single connections analysis by conside ...
Public Library of Science2011On the computational complexity of periodic scheduling
In periodic scheduling jobs arrive regularly and have to be executed on one or several machines or processors. An enormous amount of literature has been published on this topic, e.g. the founding work of Liu & Layland [LL73] is among the top cited computer ...
EPFL2009Estimation of value of travel-time savings using Mixed Logit models
In this paper, we discuss some of the issues that arise with the computation of the implied value of travel-time savings in the case of discrete choice models allowing for random taste heterogeneity. We specifically look at the case of models producing a n ...
2005