Sciweavers

347 search results - page 15 / 70
» Computable Versions of Basic Theorems in Functional Analysis
Sort
View
JCPHY
2011
192views more  JCPHY 2011»
14 years 2 months ago
Fast analysis of molecular dynamics trajectories with graphics processing units - Radial distribution function histogramming
The calculation of radial distribution functions (RDFs) from molecular dynamics trajectory data is a common and computationally expensive analysis task. The rate limiting step in ...
Benjamin G. Levine, John E. Stone, Axel Kohlmeyer
CDC
2009
IEEE
144views Control Systems» more  CDC 2009»
15 years 3 months ago
Stochastic control over finite capacity channels: Causality, feedback and uncertainty
Abstract-- Optimal communication/control analysis and design of dynamical controlled systems, when there are finite capacity communication constraints often involve information and...
Charalambos D. Charalambous, Christos K. Kourtella...
ACISP
2008
Springer
15 years 6 months ago
Methods for Linear and Differential Cryptanalysis of Elastic Block Ciphers
The elastic block cipher design employs the round function of a given, b-bit block cipher in a black box fashion, embedding it in a network structure to construct a family of ciphe...
Debra L. Cook, Moti Yung, Angelos D. Keromytis
PPSC
1989
15 years 1 months ago
Evaluating Block Algorithm Variants in LAPACK
The LAPACK software project currently under development is intended to provide a portable linear algebra library for high performance computers. LAPACK will make use of the Level 1...
Ed Anderson, Jack Dongarra
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
15 years 6 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day