Degrees of freedom of sparsely connected wireless networks
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Based on the results from a field survey campaign, this article describes three new developments which have been integrated to provide a comprehensive basis for the evaluation of overheating risk in offices. Firstly, a set of logistic regression equations ...
Abstract: Map matching algorithms are the conventional way to generate path observations from GPS data for route choice models. The deterministic matching may introduce extra biases to parameters of route choice models if the matching is wrong. In this pap ...
Attentional capture is often thought to be automatic and not modulable. For example, visual search experiments showed that salient distractor singletons strongly capture attention even when they had to be ignored by the observers. Recently, however, it was ...
Molecular noise, which arises from the randomness of the discrete events in the cell, significantly influences fundamental biological processes. Discrete-state continuous-time stochastic models (CTMC) can be used to describe such effects, but the calculati ...
Occupants exercise adaptive actions in response to discomforting environmental stimuli in an attempt to restore their comfort. These responses to adaptive actions are either ignored (conventional PMV models) or handled in an aggregated way (adaptive therma ...
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). The value of an infinite word w is computed as the maximal value of al ...
This paper presents a first approach to dynamic frequency-based transit assignment. As such the model aims to close the gap between schedule-based and frequency-based models. Frequency-based approaches have some advantages compared to schedule-based models ...
We investigate the problem of optimal risk sharing between agents endowed with cash-invariant choice functions which are law-invariant with respect to different reference probability measures. We motivate a discrete setting both from an operational and a t ...
Attention can be stimulus-driven and bottom-up or goal-driven and top-down. Bottom-up attention and, particularly, attentional capture are often thought to be strongly automatic, i.e., not modulable. For example, in visual search, it has been shown that sa ...
Association for Research in Vision and Ophthalmology2010
In this paper, two fixed per-information symbol complexity lossless source coding algorithms are modified for estimation and incremental LT decoding over piecewise stationary memoryless channels (PSMC's) with a bounded number of abrupt changes in channel s ...
