Concept

Entropy in thermodynamics and information theory

Publications associées (26)

Quantitative analysis of structural changes during rapid urban growth

New quantitative measures of urban structural changes are introduced and applied to the fast-growing city of Kerman, Iran. The results of 20,802 street measurements show that the main street orientations are orthogonal, both in the old inner part and in th ...

American Society of Civil Engineers2015

Statistical-thermodynamics modelling of the built environment in relation to urban ecology

Jean-Louis Scartezzini, Nahid Mohajeri Pour Rayeni

Various aspects of the built environment have important effects on ecology. Providing suitable metrics for the built forms so as to quantify and model their internal relations and external ecological footprints, however, remains a challenge. Here we provid ...

Elsevier2015

Neighbourhood morphology and solar irradiance in relation to urban climate

Jean-Louis Scartezzini, Dan Assouline, Nahid Mohajeri Pour Rayeni, Govinda Upadhyay

Assessing the relationship between neighbourhood morphology and urban climate is becoming increasingly important as cities continue to grow and the climate continues to change. Here we focus on the impact of (1) shapes and sizes of buildings, (2) street la ...

2015

Data Compression via Logic Synthesis

Giovanni De Micheli, Andreas Peter Burg, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù

Nowadays, most software and hardware applications are committed to reduce the footprint and resource usage of data. In this general context, lossless data compression is a beneficial technique that encodes information using fewer (or at most equal number o ...

2014

Analysing and modelling the growth and efficiency of urban transportation infrastructures

Jean-Louis Scartezzini, Nahid Mohajeri Pour Rayeni

The total population of the United Kingdom is expected to increase from 63 million in 2011 to 73 million people in 2037. This is an increase by 16% in 26 years, which puts the urban infrastructure, particularly the transportation infrastructure, under grea ...

2014

Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting

Andreas Krause, Matthias Seeger

Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is either sampled from a Gaussian process (GP) or has low norm in a reproducing ...

Institute of Electrical and Electronics Engineers2012

Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design

Andreas Krause, Matthias Seeger

Omnipress2010

Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design

Andreas Krause, Matthias Seeger

Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multi-armed bandit problem, where the payoff function is either sampled from a Gaussian process (GP) or has low RKHS norm. We resolve ...

2010

Beamforming with a Maximum Negentropy Criterion

Philip Neil Garner, Weifeng Li

In this paper, we address a beamforming application based on the capture of far-field speech data from a single speaker in a real meeting room. After the position of the speaker is estimated by a speaker tracking system, we construct a subband-domain beamf ...

2009

Adaptive Beamforming with a Maximum Negentropy Criterion

Philip Neil Garner, Weifeng Li

In this paper, we address an adaptive beamforming application in realistic acoustic conditions. After the position of a speaker is estimated by a speaker tracking system, we construct a subband-domain beamformer in generalized sidelobe canceller (GSC) conf ...

2008

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