Publication

Discrete choice models with multiplicative error terms

Publications associées (43)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Decrypting Local Type Inference

Hubert Plociniczak

Statically typed languages verify programs at compile-time. As a result many programming mistakes are detected at an early stage of development. A programmer does not have to specify types for every single term manually, however. Many programming languages ...

EPFL2016

Effects as Implicit Capabilities

Martin Odersky

We propose to investigate a new approach to effect checking that has an elegant solution to the effect polymorphism problem. The central idea is that instead of talking about effects we talk about capabilities. For instance, instead of saying a function “t ...

2015

In this paper we present a new multiplication algorithm for residues modulo the Mersenne prime

2^{521}−1

. Using this approach, on an Intel Haswell Core i7-4770, constant-time variable-base scalar multiplication on NIST’s (and SECG’s) curve P-521 requires ...

Springer Berlin Heidelberg2015

On type I blow up formation for the critical NLW

Joachim Krieger, Willie Wai Yeung Wong

We introduce a suitable concept of weak evolution in the context of the radial quintic focussing semilinear wave equation on R^{3+1}, that is adapted to continuation past type II singularities. We show that the weak extension leads to type I singularity fo ...

Taylor & Francis2014

Governance of competition and performance in European railways: An analysis of five cases

Matthias Finger

Based on extensive qualitative research, this article analyzes the governance of competition in European railways and relates this to their performance via five case studies covering the Netherlands, France, Germany, Sweden and the UK. Even though some tre ...

Elsevier Sci Ltd2014

Méthode de libération d'une pièce micromécanique et pièce micromécanique comprenant des attaches sacrificielles

Simon Nessim Henein, François Barrot, Johannes Richard Cornelis Geerit Kruis, Rémy Fournier

A method for fabricating a micromechanical part from a substrate in which the part is fabricated by providing a plurality of fasteners between the part and the substrate, the fasteners being sacrificial, characterized in that the fasteners include at least ...

Organisation Mondiale de la Propriété Intellectuelle2013

Complete Completion using Types and Weights

Viktor Kuncak, Tihomir Gvero, Ivan Kuraj, Ruzica Piskac

Developing modern software typically involves composing functionality from existing libraries. This task is difficult because libraries may expose many methods to the developer. To help developers in such scenarios, we present a technique that synthesizes ...

ACM2013

Generalised Mersenne Numbers Revisited

Robert Granger

Generalised Mersenne Numbers (GMNs) were defined by Solinas in 1999 and feature in the NIST (FIPS 186-2) and SECG standards for use in elliptic curve cryptography. Their form is such that modular reduction is extremely efficient, thus making them an attrac ...

2013

Liftings of reduction maps for quaternion algebras

Dimitar Petkov Jetchev

We construct liftings of reduction maps from complex multiplication (CM) points to supersingular points for general quaternion algebras and use these liftings to establish a precise correspondence between CM points on indefinite quaternion algebras with a ...

Oxford University Press2013

On Complete Completion using Types and Weights

Viktor Kuncak, Tihomir Gvero, Ivan Kuraj, Ruzica Piskac

Developing modern software applications typically involves composing functionality from existing libraries. This task is difficult because libraries may expose many methods to the developer. To help developers in such scenarios, we present a technique that ...

2012

In this paper we present a new multiplication algorithm for residues modulo the Mersenne prime

2^{521}−1

. Using this approach, on an Intel Haswell Core i7-4770, constant-time variable-base scalar multiplication on NIST’s (and SECG’s) curve P-521 requires ...

Springer Berlin Heidelberg2015