Concept
Duplication du cube
Publications associées (15)
Aggregation and Exploration of High-Dimensional Data Using the Sudokube Data Cube Engine
Christoph Koch, Peter Lindner, Zhekai Jiang, Sachin Basil John
We present Sudokube, a novel system that supports interactive speed querying on high-dimensional data using partially materialized data cubes. Given a storage budget, it judiciously chooses what projections to precompute and materialize during cube constru ...
Association for Computing Machinery2023Robust 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 SA2022epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics
We study the problem of constructing epsilon-coresets for the (k, z)-clustering problem in a doubling metric M(X, d). An epsilon-coreset is a weighted subset S subset of X with weight function w : S -> R->= 0, such that for any k-subset C is an element of ...
IEEE COMPUTER SOC2018Decomposition of a Cube into Nearly Equal Smaller Cubes
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 Amer2017Polynomial 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 Verlag2016New Results in the Theory of Linear and Integer Programming
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 ...
EPFL2012Covering 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 Usa2011Charge Collection Studies and Electrical Measurements of Heavily Irradiated 3D Double-Sided Sensors and Comparison to Planar Strip Detectors
Three-dimensional (3D) silicon detectors offer advantages over standard planar devices as more radiation hard sensors. These detectors and their applications in the upgrades of the LHC experiments are discussed. 3D detectors with a double-sided geometry ha ...
2011Distributed Sensor Network Localization from Local Connectivity: Performance Analysis for the HOP-TERRAIN Algorithm
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 ...
2010Algebraic, 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