The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- Zeta: A Resolution Modeling System (Q4213242) (← links)
- Optimizing a Strip Separating Two Polygons (Q4216034) (← links)
- On the application of the enhanced Hoshen–Kopelman algorithm for image analysis (Q4216198) (← links)
- A Bayesian interpretation for the exponential correlation associative memory (Q4216217) (← links)
- Density propagation for surface tracking (Q4216222) (← links)
- Structural Matching with Active Triangulations (Q4219857) (← links)
- A General Coding Scheme for Families of Digital Curve Segments (Q4220975) (← links)
- Tables of linear congruential generators of different sizes and good lattice structure (Q4221978) (← links)
- A census of cusped hyperbolic 3-manifolds (Q4221981) (← links)
- The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2 (Q4221991) (← links)
- A brief note about Rott contraction (Q4222185) (← links)
- Efficient access mechanisms for tabled logic programs (Q4223452) (← links)
- Algorithm 778: L-BFGS-B (Q4223464) (← links)
- PSQL: A query language for probabilistic relational data (Q4224396) (← links)
- Total Coloring With $\Delta + \mbox\lowercasepoly(\log \Delta)$ Colors (Q4229408) (← links)
- The Trivial Object and the Non-Uiviality of a Semantically Closed Theory with Descriptions (Q4236064) (← links)
- Optimal and efficient integration of heterogeneous summary tables in a distributed database (Q4239942) (← links)
- Greedy Strikes Back: Improved Facility Location Algorithms (Q4240134) (← links)
- Structured Backward Error and Condition of Generalized Eigenvalue Problems (Q4243516) (← links)
- Transformation radial basis neural network for relevant feature selection (Q4244579) (← links)
- Theory and practice of constraint handling rules (Q4245936) (← links)
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes (Q4250764) (← links)
- Ordered Groups: A Case Study in Reverse Mathematics (Q4254643) (← links)
- Median Graphs and Triangle-Free Graphs (Q4255811) (← links)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (Q4255836) (← links)
- Values of the Legendre chi and Hurwitz zeta functions at rational arguments (Q4257694) (← links)
- The second largest prime divisor of an odd perfect number exceeds ten thousand (Q4257704) (← links)
- The Logic of Bunched Implications (Q4262604) (← links)
- Graphs with Branchwidth at Most Three (Q4264493) (← links)
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems (Q4268710) (← links)
- Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs (Q4268849) (← links)
- Better Bounds for Online Scheduling (Q4268892) (← links)
- Variants of BICGSTAB for Matrices with Complex Spectrum (Q4271093) (← links)
- A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem (Q4272892) (← links)
- Non-monotonic reasoning with logic programming (Q4275259) (← links)
- Representing action and change by logic programs (Q4275262) (← links)
- On Rotations and the Generation of Binary Trees (Q4275333) (← links)
- How to Allocate Network Centers (Q4275335) (← links)
- Foundations of a theorem prover for functional and mathematical uses (Q4275695) (← links)
- Locally monotonic regression (Q4276656) (← links)
- Three different criteria for the design of two-dimensional zero phase FIR digital filters (Q4276692) (← links)
- On complexity of trellis structure of linear block codes (Q4277170) (← links)
- Fast Fourier Transforms for Nonequispaced Data (Q4277775) (← links)
- How to Time-Stamp a Digital Document (Q4279595) (← links)
- On the Early History of the Singular Value Decomposition (Q4280360) (← links)
- Almost all regular graphs are hamiltonian (Q4286301) (← links)
- Bell Inequalities, Grothendieck’s Constant, and Root Two (Q4287939) (← links)
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (Q4289294) (← links)
- Two Fast GCD Algorithms (Q4289843) (← links)
- Three Thresholds for a Liar (Q4291186) (← links)