Concept

Machine de Turing probabiliste

Publications associées (32)

Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension

We analyze the accuracy of the discrete least-squares approximation of a function

u

in multivariate polynomial spaces

P_\Lambda:=span\{y\mapsto y^\nu \,: \, \nu\in \Lambda\}

with

\Lambda\subset N_0^d

over the domain

\Gamma:=[-1,1]^d

, based on the s ...

2017

Applications of Real-Time Simulation Technologies in Power and Energy Systems

Mario Paolone

Real-time (RT) simulation is a highly reliable simulation method that is mostly based on electromagnetic transient simulation of complex systems comprising many domains. It is increasingly used in power and energy systems for both academic research and ind ...

2015

Design of Ultra-Low-Power Smart Wearable Systems

David Atienza Alonso, Francisco Javier Rincon Vallejos, Srinivasan Murali, Grégoire Casimir Joseph Surrel

Latest progress in microelectronics have enabled a new generation of low cost, low power, miniaturized, yet, smart sensor nodes. This new generation of wearable sensor nodes promise to deploy automated complex bio-signals analysis. In this paper, we presen ...

IEEE Press2015

Tight Bounds for Asynchronous Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

This article presents the first tight bounds on the time complexity of shared-memory renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct identifiers from a small namespace. We first prove an individual ...

Association for Computing Machinery2014

Stochastic Virtual Tests for High-Temperature Ceramic Matrix Composites

Varun Parameswaran Rajan

We review the development of virtual tests for high-temperature ceramic matrix composites with textile reinforcement. Success hinges on understanding the relationship between the microstructure of continuous-fiber composites, including its stochastic varia ...

2014

First experimental evidence of hydrodynamic tunneling of ultra-relativistic protons in extended solid copper target at the CERN HiRadMat facility

Juan Blanco Sancho, Rudiger Schmidt

A novel experiment has been performed at the CERN HiRadMat test facility to study the impact of the 440 GeV proton beam generated by the Super Proton Synchrotron on extended solid copper cylindrical targets. Substantial hydrodynamic tunneling of the proton ...

American Institute of Physics2014

An empirical study on the characterization of machined surface integrity by chip morphology in dry end-milling of titanium alloy

Muhammad Arif

Titanium alloys manifest low thermal conductivity and high work hardenability in machining. These alloys are thus considered as difficult-to-machine at higher cutting speeds and pose serious problems in machining such as degraded machined surface and rapid ...

Professional Engineering Publishing2014

Is the Network Turing-Complete?

Dejan Kostic, Peter Peresini

Ensuring correct network behavior is hard. This is the case even for simple networks, and adding middleboxes only complicates this task. In this paper, we demonstrate a fundamental property of networks. Namely, we show a way of using a network to emulate t ...

2013

What are the Odds? Probabilistic programming in Scala

Tiark Rompf, Nada Amin, Sandro Stucki, Manohar Jonnalagedda

Probabilistic programming is a powerful high-level paradigm for probabilistic modeling and inference. We present Odds, a small domain-specific language (DSL) for probabilistic programming, embedded in Scala. Odds provides first-class support for random var ...

ACM2013

A Scalable Formulation of Probabilistic Linear Discriminant Analysis: Applied to Face Recognition

Sébastien Marcel, Laurent El Shafey

In this paper we present a scalable and exact solution for probabilistic linear discriminant analysis (PLDA). PLDA is a probabilistic model that has been shown to provide state-of-the-art performance for both face and speaker recognition. However, it has o ...

Ieee Computer Soc2013

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