Publications associées à Epsilon

The epsilon expansion meets semiclassics

Riccardo Rattazzi, Alexander Monin, Gil Badel, Gabriel Francisco Cuomo

We study the scaling dimension Delta(phi n) of the operator phi(n) where phi is the fundamental complex field of the U(1) model at the Wilson-Fisher fixed point in d = 4 - epsilon. Even for a perturbatively small fixed point coupling lambda*, standard pert ...

Springer Nature2019

Maya Codical Glyph Segmentation: A Crowdsourcing Approach

Daniel Gatica-Perez, Jean-Marc Odobez, Gülcan Can

This paper focuses on the crowd-annotation of an ancient Maya glyph dataset derived from the three ancient codices that survived up to date. More precisely, non-expert annotators are asked to segment glyph-blocks into their constituent glyph entities. As a ...

2018

An improvement on the number of simplices in F-q(d)

Van Thang Pham

Let epsilon be a set of points in F-q(d). Bennett et al. (2016) proved that if \epsilon\ >> [GRAHICS] then epsilon determines a positive proportion of all k-simplices. In this paper, we give an improvement of this result in the case when epsilon is the Car ...

Elsevier Science Bv2017

Effective models for the multidimensional wave equation in heterogeneous media over long time and numerical homogenization

Timothée Noé Pouchon, Assyr Abdulle

A family of effective equations that capture the long time dispersive effects of wave propagation in heterogeneous media in an arbitrary large periodic spatial domain Omega subset of R-d is proposed and analyzed. For a wave equation with highly oscillatory ...

World Scientific Publ Co Pte Ltd2016

Irregular Product Codes

Mohammad Amin Shokrollahi, Ghid Maatouk, Seyed Omid Etesami, Masoud Alipour Babaei

We introduce irregular product codes, a class of codes where each codeword is represented by a matrix and the entries in each row (column) of the matrix come from a component row (column) code. As opposed to standard product codes, we do not require that a ...

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