The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- Roles of Inhibitory Neurons in Rewiring-Induced Synchronization in Pulse-Coupled Neural Networks (Q3564838) (← links)
- On the Maximal Number of Cubic Runs in a String (Q3564863) (← links)
- Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data (Q3564891) (← links)
- GENERATING STRUCTURE SPECIFIC NETWORKS (Q3565441) (← links)
- Conditions for triangular decoupling control (Q3566352) (← links)
- Output feedback stabilisation of networked control systems via switched system approach (Q3566363) (← links)
- Farming system performance and water use efficiency in the Tunisian semi-arid region: data envelopment analysis approach (Q3566453) (← links)
- Reward-Modulated Hebbian Learning of Decision Making (Q3568365) (← links)
- General Poisson Exact Breakdown of the Mutual Information to Study the Role of Correlations in Populations of Neurons (Q3568367) (← links)
- Timescale-Invariant Pattern Recognition by Feedforward Inhibition and Parallel Signal Processing (Q3568375) (← links)
- Hyperbolically Discounted Temporal Difference Learning (Q3568377) (← links)
- Response of Integrate-and-Fire Neurons to Noisy Inputs Filtered by Synapses with Arbitrary Timescales: Firing Rate and Correlations (Q3568378) (← links)
- Learning the Dynamical System Behind Sensory Data (Q3568381) (← links)
- Intrinsically Motivated Exploration for Developmental and Active Sensorimotor Learning (Q3568609) (← links)
- Imitation and Reinforcement Learning for Motor Primitives with Perceptual Coupling (Q3568620) (← links)
- A Survey of Statistical Network Models (Q3569376) (← links)
- A 3-Approximation for Facility Location with Uniform Capacities (Q3569815) (← links)
- Universal Sequencing on a Single Machine (Q3569821) (← links)
- Process Mining from a Basis of State Regions (Q3569869) (← links)
- A Bottom-Up Method and Fast Algorithms for max independent set (Q3569879) (← links)
- Minimum and Maximum against k Lies (Q3569886) (← links)
- Cops and Robber Game without Recharging (Q3569897) (← links)
- Faster Parameterized Algorithms for Minor Containment (Q3569902) (← links)
- Stochastic Constraint Programming by Neuroevolution with Filtering (Q3569938) (← links)
- Cost-Balancing Tolls for Atomic Network Congestion Games (Q3574300) (← links)
- Multi-trail Statistical Saturation Attacks (Q3575041) (← links)
- Adaptive Chosen-Message Side-Channel Attacks (Q3575046) (← links)
- A New Human Identification Protocol and Coppersmith’s Baby-Step Giant-Step Algorithm (Q3575057) (← links)
- Thermal-Diffusive Instability of Premixed Flames for a Simple Chain-Branching Chemistry Model with Finite Activation Energy (Q3575178) (← links)
- Graph States and the Necessity of Euler Decomposition (Q3576049) (← links)
- Bayesian Data Integration and Enrichment Analysis for Predicting Gene Function in Malaria (Q3576084) (← links)
- Higher-Order Containers (Q3576186) (← links)
- Ergodic-Type Characterizations of Algorithmic Randomness (Q3576190) (← links)
- Kolmogorov Complexity Cores (Q3576226) (← links)
- First-Spike Latency in the Presence of Spontaneous Activity (Q3576268) (← links)
- Conditional Mixture Model for Correlated Neuronal Spikes (Q3576271) (← links)
- Hesitant fuzzy sets (Q3576899) (← links)
- Power series for inverse Jacobian elliptic functions (Q3577014) (← links)
- Computational estimation of the constant $\beta (1)$ characterizing the order of $\zeta (1+it)$ (Q3577020) (← links)
- Odd perfect numbers have a prime factor exceeding $10^8$ (Q3577030) (← links)
- Recursive smoothing algorithms for the estimation of signals from uncertain observations via mixture approximations (Q3577157) (← links)
- A Data-Generation Process for Data with Specified Risk Differences or Numbers Needed to Treat (Q3577180) (← links)
- Schema mapping discovery from data instances (Q3578189) (← links)
- Finding a maximum matching in a sparse random graph in <i>O</i> ( <i>n</i> ) expected time (Q3578203) (← links)
- Routing betweenness centrality (Q3578205) (← links)
- Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas (Q3578302) (← links)
- Finding Maximum Edge Bicliques in Convex Bipartite Graphs (Q3578311) (← links)
- Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming (Q3578313) (← links)
- Indexing Similar DNA Sequences (Q3578373) (← links)
- Knowledge Representation and Non-monotonic Reasoning (Q3578392) (← links)
