The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- Learning Causal Bayesian Networks from Incomplete Observational Data and Interventions (Q3524914) (← links)
- Temporal Logic with Capacity Constraints (Q3525008) (← links)
- SWIFFT: A Modest Proposal for FFT Hashing (Q3525661) (← links)
- Cryptanalysis of LASH (Q3525674) (← links)
- New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru (Q3525694) (← links)
- Minimal Eulerian Circuit in a Labeled Digraph (Q3525806) (← links)
- Optimal Energy Control in Finite Time by varying the Length of the String (Q3525934) (← links)
- The Dynamic Programming Equation for the Problem of Optimal Investment Under Capital Gains Taxes (Q3525937) (← links)
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc (Q3525963) (← links)
- A Hierarchy of Automatic<i>ω</i>-Words having a Decidable MSO Theory (Q3526410) (← links)
- SUCCINCT MINIMAL GENERATORS: THEORETICAL FOUNDATIONS AND APPLICATIONS (Q3526975) (← links)
- ON SUCCINCT REPRESENTATION OF KNOWLEDGE COMMUNITY TAXONOMIES WITH FORMAL CONCEPT ANALYSIS (Q3526981) (← links)
- Type I and Type II Neuron Models Are Selectively Driven by Differential Stimulus Features (Q3527186) (← links)
- Rapid Convergence to Feature Layer Correspondences (Q3527188) (← links)
- Normalization Enables Robust Validation of Disparity Estimates from Neural Populations (Q3527191) (← links)
- FARAWAY POINT: A SENTINEL POINT FOR DELAUNAY COMPUTATION (Q3527439) (← links)
- DEFEASIBLE REASONING IN WEB-BASED FORMS THROUGH ARGUMENTATION (Q3528982) (← links)
- Sequences, Obligations, and the Contrary-to-Duty Paradox (Q3529367) (← links)
- Supermartingales in Prediction with Expert Advice (Q3529920) (← links)
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks (Q3532464) (← links)
- Cheap Boolean Role Constructors for Description Logics (Q3532479) (← links)
- Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems (Q3532571) (← links)
- Iteration Semirings (Q3532996) (← links)
- Universal Recursively Enumerable Sets of Strings (Q3533008) (← links)
- Algorithmically Independent Sequences (Q3533009) (← links)
- Fixed Point and Aperiodic Tilings (Q3533018) (← links)
- On the Issue of Reinstatement in Argumentation (Q3533125) (← links)
- UNCERTAINTIES FACILITATE AGGRESSIVE BEHAVIOR IN A SPATIAL HAWK–DOVE GAME (Q3533733) (← links)
- Mapping Properties of Heterogeneous Ontologies (Q3534659) (← links)
- MULTISTABILITY AND SUBTHRESHOLD ENDEMIC STATES IN A MODEL FOR THE DYNAMICS OF NONSTERILIZING HIV VACCINES (Q3536091) (← links)
- OSCILLATION AND PERIOD DOUBLING IN TCP/RED SYSTEM: ANALYSIS AND VERIFICATION (Q3536153) (← links)
- Latent Features in Similarity Judgments: A Nonparametric Bayesian Approach (Q3536225) (← links)
- Deep, Narrow Sigmoid Belief Networks Are Universal Approximators (Q3536226) (← links)
- Mutual Information Expansion for Studying the Role of Correlations in Population Codes: How Important Are Autocorrelations? (Q3536229) (← links)
- Parameters of the Diffusion Leaky Integrate-and-Fire Neuronal Model for a Slowly Fluctuating Signal (Q3536230) (← links)
- Boosting Method for Local Learning in Statistical Pattern Recognition (Q3536235) (← links)
- A complete characterization of the evolution of RC4 pseudo random generation algorithm (Q3537424) (← links)
- Matrix Nearness Problems with Bregman Divergences (Q3537440) (← links)
- Backward Error of Polynomial Eigenproblems Solved by Linearization (Q3537445) (← links)
- Sieve algorithms for the shortest vector problem are practical (Q3537523) (← links)
- Optimal<i>r</i>-order of an adjoint Broyden method without the assumption of linearly independent steps (Q3539790) (← links)
- The High-Conductance State of Cortical Networks (Q3539950) (← links)
- Irregular Firing of Isolated Cortical Interneurons in Vitro Driven by Intrinsic Stochastic Mechanisms (Q3539952) (← links)
- A Very Simple Spiking Neuron Model That Allows for Modeling of Large, Complex Systems (Q3539954) (← links)
- Bayesian Spiking Neurons I: Inference (Q3539955) (← links)
- Anonymous Proxy Signatures (Q3540046) (← links)
- Full Cryptanalysis of LPS and Morgenstern Hash Functions (Q3540051) (← links)
- Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard (Q3540133) (← links)
- A Tight Karp-Lipton Collapse Result in Bounded Arithmetic (Q3540180) (← links)
- The Descriptive Complexity of Parity Games (Q3540190) (← links)
