Keyphrases
Approximation Algorithms
11%
Caching
33%
Catenation
7%
Circular-arc Graphs
7%
Competitive Ratio
8%
Convex Hull
7%
Convex Polyhedron
7%
Deterministic Algorithm
8%
Differential Privacy
11%
Differentially Private
17%
Disjoint
18%
Disk Graph
11%
Dynamic Data Structures
11%
Expected Time
15%
Fast Algorithm
9%
Fast Recovery
7%
Generalized multiprotocol Label Switching (GMPLS)
8%
High Probability
8%
In(III)
8%
Kinetic Data Structures
11%
Label Switched Path
7%
Labeling Scheme
9%
Latency
7%
Linear Time
13%
Load Balancing
15%
Log 2
9%
Log-log
8%
Maximum Flow
8%
Minkowski Sum
7%
Optimal Algorithm
8%
Planar Graph
13%
Prefix
7%
Query Point
8%
Query Response Time
17%
Randomized Algorithms
12%
Ray Shooting
7%
Sample Complexity
8%
Search Tree
8%
Shortest Path
15%
Signed Permutation
9%
SIMPLE Algorithm
12%
Stab
8%
Streaming Algorithms
7%
Ternary Content Addressable Memory
18%
Tight
18%
Traffic Distribution
9%
Traffic Splitting
14%
Transmission Graph
7%
Unbiased Estimator
9%
Voronoi Diagram
13%
Mathematics
Approximates
41%
Asymmetric
5%
Bipartite Graph
9%
Convex Hull
8%
Convex Polyhedron
7%
Convex Set
5%
Data Structure
81%
Distance Function
7%
Edge
31%
Euclidean Distance
5%
False Negative
6%
Frchet-Distance
7%
Hyperplane
8%
Integer
10%
Interval Graph
8%
Linear Time
14%
Matrix (Mathematics)
6%
Metric Space
5%
Minimizes
13%
Minkowski Sum
7%
Multigraph
5%
Nearest Neighbor
5%
Open Problem
10%
Pairwise Disjoint
7%
Path Problem
5%
Perfect Matchings
8%
Permutation
23%
Planar Graph
13%
Planar Point
7%
Polynomial
17%
Polynomial Time
6%
Probability Theory
10%
Random Order
9%
Rounding Procedure
5%
Running Time
19%
Set Point
8%
Subset Sum
5%
Three-Dimension
11%
Unit Interval
5%
Upper Bound
15%
Variance
9%
Worst Case
33%
Computer Science
Apprenticeship Learning
5%
Approximation (Algorithm)
14%
Approximation Algorithms
8%
Approximation Ratio
5%
Binary Search Tree
6%
Bipartite Graph
8%
Common Ancestor
5%
Competitive Ratio
9%
Confidence Bound
5%
Constant Factor
8%
Data Stream
12%
Data Structure
100%
Differential Privacy
14%
Directed Graphs
12%
Distributed Algorithm
7%
Efficient Algorithm
14%
Euclidean Distance
5%
Experimental Result
5%
False Positive
6%
Fasttrack
5%
Fundamental Problem
6%
Input/Output
5%
Labeling Scheme
13%
Learning Algorithm
9%
Load Balancing
12%
Matrix Multiplication
5%
Measurement Period
5%
Metric Space
7%
Miss Rate
6%
Multi-Protocol Label Switching
7%
on-line algorithm
5%
Optimal Algorithm
10%
Perfect Matchings
5%
Polynomial Time
9%
Randomized Algorithm
7%
Reinforcement Learning
7%
Resource Constraint
5%
Sampling Algorithm
7%
Scheduling Problem
5%
Shortest Path Algorithm
5%
Shortest Path Problem
7%
Simple Algorithm
7%
Special Purpose
5%
ternary content addressable memory
14%
ternary content-addressable memory
11%
Time To Live
6%
Tree Search
7%
Unbiased Estimator
10%
Web Server
6%
Wheeler Transform
5%
