Publication

The (h, k)-Server Problem on Bounded Depth Trees

Related publications (42)

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.

Seam Carving for Text Line Extraction on Color and Grayscale Historical Manuscripts

Sabine Süsstrunk, Nikolaos Arvanitopoulos Darginis

We propose a novel algorithm for automatic text line extraction on color and grayscale manuscript pages without prior binarization. Our algorithm is based on seam carving to compute separating seams between text lines. Seam carving is likely to produce ...

2014

Uniform Analysis for Communicating Timed Systems (Extended Technical Report)

Hossein Hojjat

Languages based on the theory of timed automata are a well established approach for modelling and analysing real-time systems, with many applications both in an industrial and academic context. Model checking for timed automata has been studied extensively ...

2013

Two and a half billion years of distance research

János Pach, Filip Moric

In a seminal paper published in 1946, Erd ̋os initiated the investigation of the distribution of distances generated by point sets in metric spaces. In spite of some spectacular par- tial successes and persistent attacks by generations of mathe- maticians, ...

2013

An Efficient Algorithm for Level Set Method Preserving Distance Function

Jean-Philippe Thiran, Xavier Bresson, Dominique Zosso, Virginia Estellers Casas

The level set method is a popular technique for tracking moving interfaces in several disciplines including computer vision and fluid dynamics. However, despite its high flexibility, the original level set method is limited by two important numerical issue ...

Institute of Electrical and Electronics Engineers2012

The weighted averages algorithm revisited

Juan Ramon Mosig

The classic weighted averages (WA) algorithm for the evaluation of Sommerfeld-like integrals is reviewed and reappraised. As a result, a new version of the WA algorithm, called generalized WA, is introduced. The new version can be considered as a generaliz ...

Institute of Electrical and Electronics Engineers2012

Nonholonomic source seeking in switching random fields

Mahmut Selman Sakar

We consider the problem of designing controllers for nonholonomic mobile robots converging to the source (minimum) of a field. In addition to the mobility constraints posed by the nonholonomic dynamics, we assume that the field is completely unknown to the ...

2010

Distributed rate allocation for network-coded systems

Christina Fragouli, Amin Jafarian

This paper addresses the problem of distributed rate allocation for a class of multicast networks employing linear network coding. The goal is to minimize the cost (for example, the sum rates allocated to each link in the network) while satisfying a multic ...

2009

An online throughput-competitive algorithm for multicast routing and admission control

Monika Henzinger, Ashish Goel

We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of requests accepted by the optimum offline algorithm to the expected number of reque ...

2005

Some remarks on the uniformizing function in genus 2

Robert Silhol

The authors propose a numerical method for the uniformization of Riemann surfaces and algebraic curves in genus two with highly accurate results. Let

G

be a Fuchsian group acting on the unit disk

Bbb D

, and let

S = Bbb D / G

. It is well known that $S ...

Kluwer Academic Publishers, Springer2005

Trust-region methods based on radial basis functions with application to biomedical imaging

Rodrigue Oeuvray

We have developed a new derivative-free algorithm based on Radial Basis Functions (RBFs). Derivative-free optimization is an active field of research and several algorithms have been proposed recently. Problems of this nature in the industrial setting are ...

EPFL2005