Decision Trees for Geometric Models (Q4513214): Difference between revisions

@@ Property / cites work @@
+Probing polygons minimally is hard
@@ Property / cites work: Probing polygons minimally is hard / rank @@
+Normal rank
@@ Property / cites work @@
+Determining the shape of a convex n-sided polygon by using \(2n+k\) tactile probes
+Normal rank
@@ Property / cites work @@
+Almost optimal set covers in finite VC-dimension
@@ Property / cites work: Almost optimal set covers in finite VC-dimension / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for intersecting line segments in the plane
+Normal rank
@@ Property / cites work @@
+How to draw a planar graph on a grid
@@ Property / cites work: How to draw a planar graph on a grid / rank @@
+Normal rank
@@ Property / cites work @@
+How to find a battleship
@@ Property / cites work: How to find a battleship / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal packing and covering in the plane are NP-complete
+Normal rank
@@ Property / cites work @@
+Simplified linear-time Jordan sorting and polygon clipping
+Normal rank
@@ Property / cites work @@
+Decision tree design from a communication theory standpoint
+Normal rank
@@ Property / cites work @@
+Sorting jordan sequences in linear time using level-linked search trees
+Normal rank
@@ Property / cites work @@
+Constructing optimal binary decision trees is NP-complete
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Model-based probing strategies for convex polygons
+Normal rank
@@ Property / cites work @@
+Planar Formulae and Their Uses
@@ Property / cites work: Planar Formulae and Their Uses / rank @@
+Normal rank