Computational geometry - Globe Thesis

Keyword [Computational geometry] Result: 41 - 60 \| Page: 3 of 5
41.	Rearching An Algorithm On ESP Problem Of Visiting Disjoint Segments In The Plane
42.	Research On Complexity And Fixed Parameter Algorithms For Point Covering Problems
43.	Research On Decomposition And Computing Minkowski Sum Of Non-convex Polyhedral
44.	The Systematic Solution To The Privacy-preserving General Geometric Intersection Problem
45.	A Number Of Secure Multi-party Computation Problems
46.	Coverage Holes Detection In Wireless Sensor Networks
47.	Research On The Space Between The Different Models Under The Two Parallel Linear Distance Calculation Confidentiality Agreement
48.	Research On Secure Multi-Party Computation And Its Application
49.	A New Exact Algorithm About Convex Polyhedron Minkowski Sum In Three Dimensional Speace
50.	The Algorithm For The Three-guard Problem In A Link-2Visible Polygon
51.	Complexity And Approximation Algorithm Of Partitioning Colored Point Set Into Monochromatic Parts With Straight Line
52.	The Research On Coverage Hole Detection Algorithm For Wirelesssensor Network
53.	Research On Solving Method Of Coverage Area In Wireless Sensor Networks
54.	Research On The Algorithm For Touring A Sequence Of Disjoint Convex Polygons In The Plane
55.	Optimal Traversal Algorithms Of Disjoint Segments In Order Based On Convex Chain Storage
56.	The Application Of Persistent Homology To Image Classification And Recognition
57.	A Study Of Algorithms For Searching Mobile Intruders In A Circular Corridor By 1-Searchers
58.	Research On Secure Multiparty Computation In The Application Of Internet Of Things
59.	Online Algorithms For Searching Targets In An Unknown Region
60.	Community Correction System Based On RFID
<<First <Prev Next> Last>> Jump to