Concept

Cube (algebra)

Related publications (12)

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.

Robust numerical integration on curved polyhedra based on folded decompositions

Annalisa Buffa, Pablo Antolin Sanchez, Xiaodong Wei

We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces correspond to the g ...

ELSEVIER SCIENCE SA2022

Graph-Based Detection of Seams In 360-Degree Images

Pascal Frossard, Francesca De Simone, Sohyeong Kim, Roberto Gerson De Albuquerque Azevedo

In this paper, we propose an algorithm to detect a specific kind of distortions, referred to as seams, which commonly occur when a 360-degree image is represented in planar domain by projecting the sphere to a polyhedron, e.g, via the Cube Map (CM) project ...

2019

A Stability Theorem On Cube Tessellations

János Pach

It is shown that if a d-dimensional cube is decomposed into n cubes, the side lengths of which belong to the interval (1 - n1/d+1; 1], then n is a perfect d-th power and all cubes are of the same size. This result is essentially tight. ...

CARLETON UNIV, DEPT MATHEMATICS & STATISTICS2018

Decomposition of a Cube into Nearly Equal Smaller Cubes

János Pach

Let d be a fixed positive integer and let epsilon > 0. It is shown that for every sufficiently large n >= n(0)( d, e), the d-dimensional unit cube can be decomposed into exactly n smaller cubes such that the ratio of the side length of the largest cube to ...

Mathematical Assoc Amer2017

Polynomial diffusions and applications in finance

Damir Filipovic, Martin Larsson

This paper provides the mathematical foundation for polynomial diffusions. They play an important role in a growing range of applications in finance, including financial market models for interest rates, credit risk, stochastic volatility, commodities and ...

Springer Verlag2016

Crowding and grouping: how much time is needed to process good Gestalt?

Michael Herzog, Mauro Manassi

In crowding, perception of a target is deteriorated by flanking elements. Crowding is usually explained by pooling models where target and flanker signals are averaged. We show here that crowding is rather determined by grouping and good Gestalt. We determ ...

2013

New Results in the Theory of Linear and Integer Programming

Nicolai Hähnle

The polynomial Hirsch conjecture states that the vertex-edge diameter of a d-dimensional polyhedron with n facets is bounded by a polynomial in d and n. For the special case where the polyhedron is defined as the set of points satisfying a system Ax ≤ b of ...

EPFL2012

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

Algebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers

Pouyan Sepehrdad, Jorge Nakahara

This paper presents the first results on AIDA/cube, algebraic and side-channel attacks on variable number of rounds of all members of the KATAN family of block ciphers. Our cube attacks reach 60, 40 and 30 rounds of KATAN32, KATAN48 and KATAN64, respective ...

Springer2010

Hardware and Software Normal Basis Arithmetic for Pairing Based Cryptography in Characteristic Three

Robert Granger, Martijn Stam

Although identity-based cryptography offers a number of functional advantages over conventional public key methods, the computational costs are significantly greater. The dominant part of this cost is the Tate pairing, which, in characteristic three, is be ...

Institute of Electrical and Electronics Engineers2005