Computer Science
Efficient Algorithm
80%
Approximation Algorithms
66%
Sensor Networks
45%
Data Structure
36%
Planar Graph
34%
Optimization Problem
28%
Wireless Sensor Network
28%
Computational Geometry
22%
wireless communication system
22%
Wireless Networks
22%
Morphing
22%
Path Constraint
22%
Projective Transformation
22%
Global Positioning System
22%
Wireless Communication
22%
Gathering Data
22%
Star Network
22%
Steiner Tree Problem
22%
wireless ad hoc network
22%
Silhouette Edge
22%
Photorealistic Rendering
22%
steiner tree
22%
Physical Infrastructure
22%
Physical Attack
22%
Backbone Network
22%
Telecommunication Network
22%
Unified Framework
22%
Network Component
22%
Network Vulnerability
22%
Geographical Location
22%
Model Failure
22%
Background Model
22%
Retransmission
22%
Pattern Matching
22%
Dead Reckoning
22%
Localization Problem
22%
Encryption Technique
22%
Storage Location
22%
Protecting Data
22%
Power Consumption
22%
near neighbor query
22%
approximation scheme
17%
Bipartite Graph
17%
Sensor Placement
17%
Polynomial Time Algorithm
17%
Robot
17%
Distance Learning
17%
Geographic Region
17%
Sensitive Application
17%
Network Performance
15%
Keyphrases
Polygon
38%
Fat Objects
34%
Quadtree
34%
Bottleneck Matching
34%
Convex Objects
34%
Combinatorial Complexity
34%
Log-log
31%
Time Algorithm
29%
Line Segments
26%
Nearest Neighbor Search
22%
Nearest Neighbor Query
22%
Randomized Algorithms
22%
Vertical Decomposition
22%
Guard
22%
Planar Graph
22%
Planar Maps
22%
Base Station Placement
22%
Jordan Region
22%
Planar Segmentation
22%
Dynamic Position
22%
Static Map
22%
Centralized Server
22%
Mobile Phone Network
22%
Location Update
22%
Centralized Model
22%
Update Message
22%
Jammer
22%
Communication Resources
22%
Peer-to-peer Model
22%
Simulator System
22%
Proximity Detection
22%
User Desires
22%
Naive Approach
22%
Polyhedral Scene
22%
Planar Sets
22%
Minimum Fuel Consumption
22%
WDM Networks
22%
Geographical Failures
22%
Computational Geometric
22%
Polygon with Holes
22%
Disk Failure
22%
Geometric Matching
22%
Circular Disk
22%
Failure Model
22%
Hausdorff Distance
22%
Max-min
22%
Separator
22%
Force-directed
22%
Sensor Node Localization
22%
Proximity Problems
22%
Mathematics
Edge
100%
Polygon
86%
Planar Graph
53%
Minimizes
38%
Line Segment
34%
Set Point
32%
Hausdorff
31%
Simple Polygon
27%
Euclidean Distance
26%
Homotopic
24%
Ellipse
22%
Planar Map
22%
Vertical Decomposition
22%
Fat Object
22%
Hausdorff Measure
22%
Union of Jordan Region
22%
Long Line
22%
Polygonal Region
22%
Problem Circle
22%
Closed Ball
22%
Data Structure
22%
Graph Embedding
22%
Triangle
22%
Polygon with Hole
22%
Frchet-Distance
22%
Running Time
22%
Force-Directed Approach
22%
Noisy Data
22%
Dimensional Problem
22%
Linear Time
22%
Matching Problem
19%
Total Number
17%
Worst Case
17%
Intersects
17%
Integer
16%
Closest Pair
16%
Higher Dimensions
15%
Nonempty Subset
15%
Path Problem
15%
Nearest Neighbor
13%
Circle
12%
Similarity Measure
11%
Distance Function
11%
Searching Range
11%
Intersection Point
11%
Positive Integer
11%
Polynomial
11%
Algebraic Function
11%
Tree Problem
11%
Rigid Motion
11%
