The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Page 1 Next

Displaying 1 – 20 of 48

Showing per page

Edon- ( 256 , 384 , 512 ) – an efficient implementation of Edon- family of cryptographic hash functions

Danilo Gligoroski, Svein Johan Knapskog (2008)

Commentationes Mathematicae Universitatis Carolinae

We have designed three fast implementations of a recently proposed family of hash functions Edon– . They produce message digests of length n = 256 , 384 , 512 bits and project security of 2 n 2 hash computations for finding collisions and 2 n hash computations for finding preimages and second preimages. The design is not the classical Merkle-Damgård but can be seen as wide-pipe iterated compression function. Moreover the design is based on using huge quasigroups of orders 2 256 , 2 384 and 2 512 that are constructed by using only bitwise...

Efficient generation of 3D surfel maps using RGB-D sensors

Artur Wilkowski, Tomasz Kornuta, Maciej Stefańczyk, Włodzimierz Kasprzak (2016)

International Journal of Applied Mathematics and Computer Science

The article focuses on the problem of building dense 3D occupancy maps using commercial RGB-D sensors and the SLAM approach. In particular, it addresses the problem of 3D map representations, which must be able both to store millions of points and to offer efficient update mechanisms. The proposed solution consists of two such key elements, visual odometry and surfel-based mapping, but it contains substantial improvements: storing the surfel maps in octree form and utilizing a frustum culling-based...

Efficient RGB-D data processing for feature-based self-localization of mobile robots

Marek Kraft, Michał Nowicki, Rudi Penne, Adam Schmidt, Piotr Skrzypczyński (2016)

International Journal of Applied Mathematics and Computer Science

The problem of position and orientation estimation for an active vision sensor that moves with respect to the full six degrees of freedom is considered. The proposed approach is based on point features extracted from RGB-D data. This work focuses on efficient point feature extraction algorithms and on methods for the management of a set of features in a single RGB-D data frame. While the fast, RGB-D-based visual odometry system described in this paper builds upon our previous results as to the general...

Energía informacional útil.

Leandro Pardo Llorente (1981)

Trabajos de Estadística e Investigación Operativa

En este trabajo se adapta la medida de Información dada por Onicescu en 1966, denominada Energía Informacional, a situaciones en las cuales existe una función de utilidad definida sobre los resultados del experimento; a esa medida de Información la denominaremos Energía Informacional Útil.

Entropies of vague information sources

Milan Mareš (2011)

Kybernetika

The information-theoretical entropy is an effective measure of uncertainty connected with an information source. Its transfer from the classical probabilistic information theory models to the fuzzy set theoretical environment is desirable and significant attempts were realized in the existing literature. Nevertheless, there are some open topics for analysis in the suggested models of fuzzy entropy - the main of them regard the formal aspects of the fundamental concepts. Namely their rather additive...

Entropy generation in a model of reversible computation

Diego de Falco, Dario Tamascelli (2006)

RAIRO - Theoretical Informatics and Applications

We present a model in which, due to the quantum nature of the signals controlling the implementation time of successive unitary computational steps, physical irreversibility appears in the execution of a logically reversible computation.

Entropy jumps for isotropic log-concave random vectors and spectral gap

Keith Ball, Van Hoang Nguyen (2012)

Studia Mathematica

We prove a quantitative dimension-free bound in the Shannon-Stam entropy inequality for the convolution of two log-concave distributions in dimension d in terms of the spectral gap of the density. The method relies on the analysis of the Fisher information production, which is the second derivative of the entropy along the (normalized) heat semigroup. We also discuss consequences of our result in the study of the isotropic constant of log-concave distributions (slicing problem).

Currently displaying 1 – 20 of 48

Page 1 Next