Publications related to List of logarithmic identities

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

Expert Judgements in Risk Analysis: a Strategy to Overcome Uncertainities

Thierry Meyer, Amela Groso, David Nicolas Plüss

There is a need for a risk analysis technique specific for academic research laboratories. Since accurate accident data, normally required for quantitative risk analysis, are not available for this environment, expert judgements are often used to describe ...

2013

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

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

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

Faster and Smoother - VSH Revisited

Juraj Sarinay

We reconsider the provably collision resistant Very Smooth Hash and propose a small change in the design aiming to improve both performance and security. While the original proofs of security based on hardness of factoring or discrete logarithms are preser ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 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

An indirect assessment on the impact of connectivity of conductivity classes upon longitudinal asymptotic macrodispersivity

Samir Suweis

Solute transport takes place in heterogeneous porous formations, with the log conductivity, Y = ln K, modeled as a stationary random space function of given univariate normal probability density function (pdf) with mean Y, variance σY2, and integral scale ...

American Geophysical Union2010

Efficient Protocols for Set Membership and Range Proofs

Rafik Chaabouni

We consider the following problem: Given a commitment to a value σ, prove in zero-knowledge that σ belongs to some discrete set Φ. The set Φ can perhaps be a list of cities or clubs; often Φ can be a numerical range such as [1, 220]. This problem arises in ...

Springer2008

Scheduling data transfers in a network and the set scheduling problem

Monika Henzinger, Ashish Goel

In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that opt ...

2003

List of logarithmic identities

Graph Chatbot

Chat with Graph Search

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

Expert Judgements in Risk Analysis: a Strategy to Overcome Uncertainities

The Complexity of Renaming

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

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Faster and Smoother - VSH Revisited

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

An indirect assessment on the impact of connectivity of conductivity classes upon longitudinal asymptotic macrodispersivity

Efficient Protocols for Set Membership and Range Proofs

Scheduling data transfers in a network and the set scheduling problem

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

Expert Judgements in Risk Analysis: a Strategy to Overcome Uncertainities

Scheduling data transfers in a network and the set scheduling problem

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

An indirect assessment on the impact of connectivity of conductivity classes upon longitudinal asymptotic macrodispersivity

The Complexity of Renaming

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

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Faster and Smoother - VSH Revisited

Efficient Protocols for Set Membership and Range Proofs