Sciweavers

1802 search results - page 127 / 361
» Complexity Theory for Operators in Analysis
Sort
View
GECCO
2011
Springer
240views Optimization» more  GECCO 2011»
14 years 9 months ago
Collisions are helpful for computing unique input-output sequences
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
Chao Qian, Yang Yu, Zhi-Hua Zhou
CORR
2010
Springer
261views Education» more  CORR 2010»
15 years 3 months ago
Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
Mathieu Cunche, Valentin Savin, Vincent Roca
IVC
2007
90views more  IVC 2007»
15 years 6 months ago
Numerical residues
Binary morphological transformations based on the residues (ultimate erosion, skeleton by openings, etc.) are extended to functions by means of the transformation definition and o...
Serge Beucher
SC
2004
ACM
15 years 11 months ago
Ultrascalable Implicit Finite Element Analyses in Solid Mechanics with over a Half a Billion Degrees of Freedom
The solution of elliptic diffusion operators is the computational bottleneck in many simulations in a wide range of engineering and scientific disciplines. We present a truly sca...
Mark F. Adams, Harun H. Bayraktar, Tony M. Keaveny...
FMICS
2008
Springer
15 years 8 months ago
Formal Verification of the Implementability of Timing Requirements
There has been relatively little work on the implementability of timing requirements. We have previously provided definitions of fundamental timing operators that explicitly consid...
Xiayong Hu, Mark Lawford, Alan Wassyng