Threshold Saturation in Spatially Coupled Constraint Satisfaction Problems
Related publications (43)
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.
The life cycle of several sessile or highly sedentary aquatic species is characterized by a pelagic stage, during which propagules are dispersed by the water flow. As a consequence, hydrodynamics plays a crucial role in redistributing offspring. In this wo ...
The E* algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation, it results in more appropriate paths during gradient descent. The underlying formulation is based on interpreting navigation functions a ...
Mudflows are catastrophic events that cause immense damage to infrastructure and life every year. Local authorities have been trying to mitigate the risk by zoning regulations as well as by building protection structures for many years. These measures have ...
We model the dynamics of self-organized robot aggregation inspired by a study on aggregation of gregarious arthropods. In swarms of German cockroaches, aggregation into clusters emerges solely from local interactions between the individuals, whereas the pr ...
This paper presents an interpolation method based on shifted versions of two piecewise linear generators, which provides approximation order 2 like usual piecewise-linear interpolation; i.e., this method is able to represent the constant and the ramp exact ...
Achieving accurate interpolation is an important requirement for many signal-processing applications. While nearest-neighbor and linear interpolation methods are popular due to their native GPU support, they unfortunately result in severe undesirable artif ...
Derivative-free optimization involves the methods used to minimize an expensive objective functionwhen its derivatives are not available. We present here a trust-region algorithmbased on Radial Basis Functions (RBFs). The main originality of our approach i ...
This paper addresses the problem of interpolating signals defined on a 2-d sphere from non-uniform samples. We present an interpolation method based on locally weighted linear and nonlinear regression, which takes into account the differences in importance ...
Classical digital signal processing (DSP) lore tells us the tale of a continuous-time primeval signal, of its brutal sampling, and of the magic sinc interpolation that, under the aegis of bandlimitedness, brings the original signal back to (continuous) lif ...
The E-star algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of an underlying smooth goal distance that takes into account a continuous notion ...