The following pages link to Godfried Toussaint (Q182688):
Displaying 48 items.
- Comments on "On a New Class of Bounds on Bayes' Risk in Multihypothesis Pattern Recognition" (Q4066645) (← links)
- A Generalization of Shannon's Equivocation and the Fano Bound (Q4138636) (← links)
- Probability of Error, Expected Divergence, and the Affinity of Several Distributions (Q4164204) (← links)
- A bottom-up and top-down approach to using context in text recognition (Q4176997) (← links)
- Editorial (Q4274649) (← links)
- Slicing an ear using prune-and-search (Q4274653) (← links)
- The Graham scan triangulates simple polygons (Q4310640) (← links)
- A counterexample to Tomek's consistency theorem for a condensed nearest neighbor decision rule (Q4324593) (← links)
- (Q4401033) (← links)
- (Q4427858) (← links)
- Simple Proofs of a Geometric Property of Four-Bar Linkages (Q4469190) (← links)
- COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON (Q4513233) (← links)
- (Q4525680) (← links)
- Simple Deterministic Algorithms for Generating “Good” Musical Rhythms (Q4686641) (← links)
- Convex Hulls for Random Lines (Q4696647) (← links)
- (Q4741714) (← links)
- Efficient algorithms for computing the maximum distance between two finite planar sets (Q4747526) (← links)
- (Q4789806) (← links)
- (Q4797604) (← links)
- Growing a Tree from Its Branches (Q4840220) (← links)
- On Envelopes of Arrangements of Lines (Q4895801) (← links)
- Open Guard Edges and Edge Guards in Simple Polygons (Q4899264) (← links)
- (Q4906197) (← links)
- Quadrangulations of planar sets (Q5057435) (← links)
- Filling polyhedral molds (Q5060114) (← links)
- Linear approximation of simple objects (Q5096785) (← links)
- The Geometry of Musical Rhythm (Q5223464) (← links)
- Deflating the Pentagon (Q5302738) (← links)
- GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING (Q5311630) (← links)
- The Geometry of Musical Rhythm (Q5449768) (← links)
- Algorithms for Recognizing Contour-Traced Handprinted Characters (Q5590432) (← links)
- On a Simple Minkowski Metric Classifier (Q5618169) (← links)
- Use of Contextual Constraints in Recognition of Contour-Traced Handprinted Characters (Q5618913) (← links)
- Some Upper Bounds on Error Probability for Multiclass Pattern Recognition (Q5629250) (← links)
- Some Functional Lower Bounds on the Expected Divergence for Multihypothesis Pattern Recognition, Communication, and Radar Systems (Q5636752) (← links)
- Polynomial Representation of Classifiers with Independent Discrete-Valued Features (Q5640755) (← links)
- Some Inequalities Between Distance Measures for Feature Evaluation (Q5643602) (← links)
- (Q5859848) (← links)
- Discrete and Computational Geometry (Q5897111) (← links)
- Algorithms and Data Structures (Q5900775) (← links)
- Linear approximation of simple objects (Q5906528) (← links)
- Geometric and computational aspects of polymer reconfiguration (Q5934419) (← links)
- A new class of stuck unknots in \(\text{Pol}_6\) (Q5948408) (← links)
- Simple polygons with an infinite sequence of deflations (Q5948409) (← links)
- Reconfiguring convex polygons (Q5952973) (← links)
- Locked and unlocked polygonal chains in three dimensions (Q5953071) (← links)
- Every set of disjoint line segments admits a binary tree (Q5953078) (← links)
- No quadrangulation is extremely odd (Q6487985) (← links)
