Publications related to Decade (log scale)

Analytical approximation for the recession of a sloping aquifer

An approximation is obtained for the recession of a sloping aquifer. The analytical approximation can provide a useful tool to analyze data and obtain physical properties of the aquifer. In contrast to the case of a horizontal aquifer, when plotting the ti ...

American Geophysical Union2014

Accounting for inertia effects to access the high-frequency microrheology of viscoelastic fluids

László Forró, Sylvia Jeney, Elena Bertseva, Frank Scheffold

We study the Brownian motion of microbeads immersed in water and in a viscoelastic wormlike micelles solution by optical trapping interferometry and diffusing wave spectroscopy. Through the mean-square displacement obtained from both techniques, we deduce ...

Amer Physical Soc2014

Analysis of Discrete L2 Projection on Polynomial Spaces with Random Evaluations

Fabio Nobile, Giovanni Migliorati, Erik Gustaf Bogislaw Von Schwerin

We analyse the problem of approximating a multivariate function by discrete least-squares projection on a polynomial space starting from random, noise-free observations. An area of possible application of such technique is Uncertainty Quantification (UQ) f ...

2014

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

Approximation of Quantities of Interest in Stochastic PDEs by the Random Discrete $L^2$ Projection on Polynomial Spaces

Fabio Nobile, Giovanni Migliorati, Erik Gustaf Bogislaw Von Schwerin

In this work we consider the random discrete

L^2

projection on polynomial spaces (hereafter RDP) for the approximation of scalar quantities of interest (QOIs) related to the solution of a partial differential equation model with random input parameters. ...

Siam Publications2013

MATHICSE Technical Report : Analysis of the discrete $L^2$ projection on polynomial spaces with random evaluations

Fabio Nobile, Giovanni Migliorati, Erik Gustaf Bogislaw Von Schwerin

We analyse the problem of approximating a multivariate function by discrete least-squares projection on a polynomial space starting from random, noise-free observations. An area of possible application of such technique is Uncertainty Quantification (UQ) f ...

MATHICSE2011

The Complexity of Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

We study the complexity of renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct names from a given namespace. We prove an individual lower bound of Omega(k) process steps for deterministic renaming into ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2011

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

We give two new randomized algorithms for tight renaming, both of which work against an adaptive adversary. The first uses repeated sampling over a sequence of arrays of decreasing size to assign unique names to each of

n

processes with step complexity $ ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

Dictionary Identification - Sparse Matrix-Factorisation via $\ell_1$-Minimisation

Rémi Gribonval, Karin Schnass

This article treats the problem of learning a dictionary providing sparse representations for a given signal class, via

\ell_1

-minimisation. The problem can also be seen as factorising a

\ddim \times \nsig

matrix $Y=(y_1 \ldots y_\nsig), , y_n\in \R^\ ...

Institute of Electrical and Electronics Engineers2010

Basis Identification from Random Sparse Samples

Rémi Gribonval, Karin Schnass

This article treats the problem of learning a dictionary providing sparse representations for a given signal class, via

\ell_1

minimisation. The problem is to identify a dictionary

\dico

from a set of training samples

\Y

knowing that

\Y = \dico \X

...

2009

Decade (log scale)

Graph Chatbot

Chat with Graph Search

Analytical approximation for the recession of a sloping aquifer

Accounting for inertia effects to access the high-frequency microrheology of viscoelastic fluids

Analysis of Discrete L2 Projection on Polynomial Spaces with Random Evaluations

Tight Bounds for Asynchronous Renaming

Approximation of Quantities of Interest in Stochastic PDEs by the Random Discrete $L^2$ Projection on Polynomial Spaces

MATHICSE Technical Report : Analysis of the discrete $L^2$ projection on polynomial spaces with random evaluations

The Complexity of Renaming

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Dictionary Identification - Sparse Matrix-Factorisation via $\ell_1$-Minimisation

Basis Identification from Random Sparse Samples

The Complexity of Renaming

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Analysis of Discrete L2 Projection on Polynomial Spaces with Random Evaluations

Accounting for inertia effects to access the high-frequency microrheology of viscoelastic fluids

Tight Bounds for Asynchronous Renaming

Analytical approximation for the recession of a sloping aquifer

MATHICSE Technical Report : Analysis of the discrete $L^2$ projection on polynomial spaces with random evaluations

Approximation of Quantities of Interest in Stochastic PDEs by the Random Discrete $L^2$ Projection on Polynomial Spaces

Dictionary Identification - Sparse Matrix-Factorisation via $\ell_1$-Minimisation

Basis Identification from Random Sparse Samples