Publication

An Algorithm to Compute Bounds for the Star Discrepancy

Related publications (27)

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.

Le but de cet article est de donner des bornes supérieures pour les minima euclidiens de corps abéliens, en particulier dans le cas des corps abéliens de conducteurs des puissances de nombres premiers. ...

2015

Lessons from Nature: Computational Design of Biomimetic Compounds and Processes

Ursula Röthlisberger, Pablo Campomanes Ramos, Elizabeth Claire Brunk, Negar Ashari Astani, Marta Andreia Da Silva Perez, Esra Bozkurt, Nicholas John Browning

Through millions of years of evolution, Nature has accomplished the development of highly efficient and sustainable processes and the idea to understand and copy natural strategies is therefore very appealing. However, in spite of intense experimental and ...

2014

A 3D moving mesh Finite Element Method for two-phase flows

John Richard Thome, Navid Borhani, Gustavo Rabello Dos Anjos

A 3D ALE Finite Element Method is developed to study two-phase flow phenomena using a new discretization method to compute the surface tension forces. The computational method is based on the Arbitrary Lagrangian-Eulerian formulation (ALE) and the Finite E ...

Elsevier2014

Expected loss bounds for authentication in constrained channels

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

We derive bounds on the expected loss for authenti-cation protocols in channels which are constrained due to noisyconditions and communication costs. This is motivated by anumber of authentication protocols, where at least some partof the authentication is ...

Ieee2012

Covering Cubes and the Closest Vector Problem

Friedrich Eisenbrand, Martin Niemeier, Nicolai Hähnle

We provide the currently fastest randomized (1+epsilon)-approximation algorithm for the closest vector problem in the infinity-norm. The running time of our method depends on the dimension n and the approximation guarantee epsilon by 2^(O(n))(log(1/epsilon ...

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

Extended Keyframe Detection with Stable Tracking for Multiple 3D Object Tracking

Vincent Lepetit

We present a method that is able to track several 3D objects simultaneously, robustly, and accurately in real time. While many applications need to consider more than one object in practice, the existing methods for single object tracking do not scale well ...

Institute of Electrical and Electronics Engineers2011

This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the localization algorithm MDS-MAP proposed by Y. Shang \textit{et al} is able to ...

2010

Solving the chemical master equation using sliding windows

Maria-Emanuela-Canini Mateescu, Verena Wolf, Rushil Goel

The chemical master equation (CME) is a system of ordinary differential equations that describes the evolution of a network of chemical reactions as a stochastic process. Its solution yields the probability density vector of the system at each point in tim ...

BioMed Central2010

Ideal knots and other packing problems of tubes

Henryk Gerlach

This thesis concerns optimal packing problems of tubes, or thick curves, where thickness is defined as follows. Three points on a closed space curve define a circle. Taking the infimum over all radii of pairwise-distinct point triples defines the thickness ...

EPFL2010

One major methodological problem in analysis of sequence data is the determination of costs from which distances between sequences are derived. Although this problem is currently not optimally dealt with in the social sciences, it has some similarity with ...

SAGE Publications2009