Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Home

Concept

Algorithmically random sequence

Formal sciences
Mathematics
Probability theory
Topics in probability theory

About
Privacy
Disclaimer

Graph Chatbot

Related publications (28)

Page 2 of 2

Lyapunov exponents of random walks in small random potential: the upper bound

Thomas Mountford, Jean-Christophe Mourrat

We consider the simple random walk on Z(d) evolving in a random i.i.d. potential taking values in [0, +infinity). The potential is not assumed integrable, and can be rescaled by a multiplicative factor lambda > 0. Completing the work started in a companion ...

Univ Washington, Dept Mathematics2015

A continuation multilevel Monte Carlo algorithm

Fabio Nobile, Erik Gustaf Bogislaw Von Schwerin

We propose a novel Continuation Multi Level Monte Carlo (CMLMC) algorithm for weak approximation of stochastic models. The CMLMC algorithm solves the given approximation problem for a sequence of decreasing tolerances, ending when the required error tolera ...

2015

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

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Boi Faltings, Immanuel Trummer

The goal of multi-objective quality-driven service selection (QDSS) is to find service selections for a workflow whose quality-of-service (QoS) values are Pareto-optimal. We consider multiple QoS attributes such as response time, cost, and reliability. A s ...

Institute of Electrical and Electronics Engineers2014

Comparing the Predictive Capability of Social and Interest Affinity for Recommendations

Karl Aberer, Anne-Marie Kermarrec, Alexandra Olteanu

The advent of online social networks created new prediction opportunities for recommender systems: instead of relying on past rating history through the use of collaborative filtering (CF), they can leverage the social relations among users as a predictor ...

Springer-Verlag Berlin2014

Masking vs. Multiparty Computation: How Large Is the Gap for AES?

Sebastian Faust

In this paper, we evaluate the performances of state-of-the art higher-order masking schemes for the AES. Doing so, we pay a particular attention to the comparison between specialized solutions introduced exclusively as countermeasures against side-channel ...

2013

Chains of mean-field models

Rüdiger Urbanke, Nicolas Macris, Seyed Hamed Hassani

We consider a collection of Curie-Weiss (CW) spin systems, possibly with a random field, each of which is placed along the positions of a one-dimensional chain. The CW systems are coupled together by a Kac-type interaction in the longitudinal direction of ...

2012

Compressibility of Deterministic and Random Infinite Sequences

Michaël Unser, Arash Amini

We introduce a definition of the notion of compressibility for infinite deterministic and i.i.d. random sequences which is based on the asymptotic behavior of truncated subsequences. For this purpose, we use asymptotic results regarding the distribution of ...

IEEE2011