Publications related to Covering Cubes and the Closest Vector Problem

A Recursive Acceleration Technique for Static Potential Green's Functions of a Rectangular Cavity Combining Image and Modal Series

Juan Ramon Mosig, Michael Mattes, Sergio Lopez Pena

A hybrid acceleration algorithm for the computation of the static potential Green’s functions of a rectangular cavity is proposed. Similarly to Ewald’s method, it combines the series expansions in terms of images and modes. The main particularity with resp ...

Institute of Electrical and Electronics Engineers2011

A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks

Thomas Rothvoss

We present a new approximation algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines. We prove that for an arbitrary parameter k it yields solutions with at most (3/2 + 1/k)*OPT+9k many processors, thus it gives a ...

Springer2010

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

Computing All Faces of the Minkowski Sum of V-Polytopes

Christophe Weibel

We consider the problem of listing faces of the Minkowski sum of several V-polytopes in R^d. An algorithm for listing all faces of dimension up to j is presented, for any given 0

2005

Active measurement for multiple link failure diganosis in IP networks

Patrick Thiran, Xuan Hung Nguyen

Simultaneous link failures are common in IP networks \cite{Markopoulou04}. In this paper, we develop a technique for locating multiple failures in Service Provider or Enterprise IP networks using active measurement. We propose a two-phased approach that mi ...

2004

Least-Squares Image Resizing Using Finite Differences

Michaël Unser, Thierry Blu

We present an optimal spline-based algorithm for the enlargement or reduction of digital images with arbitrary (noninteger) scaling factors. This projection-based approach can be realized thanks to a new finite difference method that allows the computation ...

IEEE2001

Method for producing contrast-controlled grayscale characters

Roger Hersch

The invention teaches grayscale specific character outline modification techniques for synthesizing contrast controlled grayscale pixmap characters of improved appearance at any resolution and size. In addition, methods for computing the visually optimal s ...

2001

An Algorithm to Compute Bounds for the Star Discrepancy

Eric Thiémard

We propose an algorithm to compute upper and lower bounds for the star discrepancy of an arbitrary sequence of points in the s-dimensional unit cube. The method is based on a particular partition of the unit cube into subintervals and on a specialized proc ...

2001

Distance transformations: fast algorithms and applications to medical image processing

Olivier Cuisenaire

Medical image processing is a demanding domain, both in terms of CPU and memory requirements. The volume of data to be processed is often large (a typical MRI dataset requires 10 MBytes) and many processing tools are only useful to the physician if they ar ...

1999

Compressed Sensing and Adaptive Graph Total Variation for Tomographic Reconstructions

Pierre Vandergheynst, Nauman Shahid

Compressed Sensing (CS) and Total Variation (TV)- based iterative image reconstruction algorithms have received increased attention recently. This is due to the ability of such methods to reconstruct from limited and noisy data. Local TV methods fail to pr ...

0

Covering Cubes and the Closest Vector Problem

Graph Chatbot

Chat with Graph Search

A Recursive Acceleration Technique for Static Potential Green's Functions of a Rectangular Cavity Combining Image and Modal Series

A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks

Some remarks on the uniformizing function in genus 2

Computing All Faces of the Minkowski Sum of V-Polytopes

Active measurement for multiple link failure diganosis in IP networks

Least-Squares Image Resizing Using Finite Differences

Method for producing contrast-controlled grayscale characters

An Algorithm to Compute Bounds for the Star Discrepancy

Distance transformations: fast algorithms and applications to medical image processing

Compressed Sensing and Adaptive Graph Total Variation for Tomographic Reconstructions

Distance transformations: fast algorithms and applications to medical image processing

Method for producing contrast-controlled grayscale characters

Active measurement for multiple link failure diganosis in IP networks

Least-Squares Image Resizing Using Finite Differences

An Algorithm to Compute Bounds for the Star Discrepancy

A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks

A Recursive Acceleration Technique for Static Potential Green's Functions of a Rectangular Cavity Combining Image and Modal Series

Computing All Faces of the Minkowski Sum of V-Polytopes

Compressed Sensing and Adaptive Graph Total Variation for Tomographic Reconstructions

Some remarks on the uniformizing function in genus 2