The following pages link to (Q3869197):
Displaying 37 items.
- On compressing and indexing repetitive sequences (Q390894) (← links)
- Publishing anonymous survey rating data (Q408666) (← links)
- Exact and approximation algorithms for error-detecting even codes (Q441883) (← links)
- New property of a generalized Hölder's inequality and its applications (Q508730) (← links)
- Coherent infomax as a computational goal for neural systems (Q535580) (← links)
- Stability and accuracy functions for a multicriteria Boolean linear programming problem with parameterized principle of optimality ``from Condorcet to Pareto'' (Q613477) (← links)
- Parallel lossless image compression using Huffman and arithmetic coding (Q671379) (← links)
- Minimal path length of trees with known fringe (Q673649) (← links)
- Optimal weighted nearest neighbour classifiers (Q741805) (← links)
- Quantum information as a measure of multipartite correlation (Q892631) (← links)
- Minimum message length encoding and the comparison of macromolecules (Q912791) (← links)
- A note on the construction of error detecting/correcting prefix codes (Q963391) (← links)
- Hierarchical resolution of power spectra (Q994958) (← links)
- Nonlinear data observability and information (Q1106788) (← links)
- Theory construction in psychology: The interpretation and integration of psychological data (Q1157291) (← links)
- An analysis of a class of algorithms for \(S\)-box construction (Q1335025) (← links)
- Metric inference for social networks (Q1344868) (← links)
- A random-walk pseudorandom byte generator (Q1591115) (← links)
- An efficient algorithm for solving the partial sum query problem (Q1602518) (← links)
- An information theoretic model of a reliable computer network (Q1808993) (← links)
- Supervised pattern recognition by parallel feature partitioning (Q1886643) (← links)
- Dynamic design of a reliable computer network on using information theory (Q1963067) (← links)
- Controlling and restoring the integrity of multi-dimensional data arrays through cryptocode constructs (Q2064389) (← links)
- Fast robust optimization using bias correction applied to the mean model (Q2225367) (← links)
- A novel splicing/decomposable binary encoding and its operators for genetic and evolutionary algorithms (Q2383822) (← links)
- A Maiorana--McFarland type construction for resilient Boolean functions on \(n\) variables (\(n\) even) with nonlinearity \(>2^{n-1}-2^{n/2}+2^{n/2-2}\) (Q2489931) (← links)
- New insights on neutral binary representations for evolutionary optimization (Q2628777) (← links)
- A GENERALIZATION OF HAUSDORFF DIMENSION APPLIED TO HILBERT CUBES AND WASSERSTEIN SPACES (Q3166254) (← links)
- A FIRST-ORDER OPTIMAL ALGORITHM FOR STATE IDENTIFICATION IN SEQUENTIAL LOGIC USING THE CONCEPT OF ENTROPY (Q3799635) (← links)
- Minimization of rounding errors algebraically by use of coding theory (Q3800987) (← links)
- On the Influence of the State Encoding on OBDD-Representations of Finite State Machines (Q4256140) (← links)
- On the errors that learning machines will make (Q4307811) (← links)
- THE GROUPS OF RICHARD THOMPSON AND COMPLEXITY (Q4658702) (← links)
- Parity codes (Q4680739) (← links)
- (Q4847230) (← links)
- THE DEUTSCH–JOZSA ALGORITHM REVISITED IN THE DOMAIN OF CRYPTOGRAPHICALLY SIGNIFICANT BOOLEAN FUNCTIONS (Q5696623) (← links)
- Recoverable formal language (Q6173464) (← links)
