The following pages link to Sparse neural codes and convexity (Q2424284):
Displaying 16 items.
- Embedding dimension phenomena in intersection complete codes (Q2064042) (← links)
- Non-monotonicity of closed convexity in neural codes (Q2135080) (← links)
- Neural codes with three maximal codewords: convexity and minimal embedding dimension (Q2163062) (← links)
- Periodic neural codes and sound localization in barn owls (Q2163423) (← links)
- Neural codes and the factor complex (Q2300577) (← links)
- Strongly maximal intersection-complete neural codes on grids are convex (Q2335598) (← links)
- Minimal embedding dimensions of connected neural codes (Q2659088) (← links)
- Neural codes and homotopy types: mathematical models of place field recognition (Q2802998) (← links)
- Gröbner bases of neural ideals (Q4576004) (← links)
- Neural Codes, Decidability, and a New Local Obstruction to Convexity (Q4634350) (← links)
- Permitted Sets and Convex Coding in Nonthreshold Linear Networks (Q5044211) (← links)
- Hyperplane Neural Codes and the Polar Complex (Q5118374) (← links)
- Efficient Neural Codes That Minimize <i>L<sub>p</sub></i> Reconstruction Error (Q5380598) (← links)
- Nondegenerate Neural Codes and Obstructions to Closed-Convexity (Q5883278) (← links)
- Wheels: a new criterion for non-convexity of neural codes (Q6170336) (← links)
- Canonical forms of neural ideals (Q6564019) (← links)