Keyphrases
Approximate Nearest Neighbor Search
24%
Approximation Algorithms
55%
Approximation Factor
36%
Better Approximation
48%
Bipartite Graph
28%
Computer Linguistics
24%
Connected Matchings
24%
Constant Approximation
30%
Data-driven Algorithm
48%
Dimensionality Reduction
42%
Eccentricity
48%
Element Return
24%
Euclidean Metric
48%
Expander
24%
Few-shot
24%
Generalization Bounds
24%
Graph Stream
24%
Graph Theoretic Approach
24%
Hardness Results
33%
High Dimension
32%
High-dimensional Data
32%
K-nearest Neighbor (K-NN)
38%
Kernel Density Estimation
55%
Learning-based
30%
Log-log
24%
Logging System
24%
Low-rank Approximation
55%
Metric Compression
73%
Near-optimal
30%
Nearest Neighbor Search
48%
Network Architecture
24%
Neural Network
47%
Numerical Linear Algebra
24%
Popular
32%
Quantile Approximation
48%
Query Point
48%
Sample Complexity
30%
Scalable Machine Learning
24%
Set Cover
28%
Streaming Algorithms
40%
Sublinear Time
28%
Support Estimation
24%
System Administrator
24%
Temporal Labels
24%
Tight
36%
Training Time
24%
Triangle Cycle
24%
Volume Regularization
24%
Weisfeiler-Lehman Test
24%
Worst-Case Guarantees
48%
Mathematics
Approximates
100%
Bipartite Graph
24%
Closest Pair
24%
Clustering
24%
Complexity Space
28%
Coordinate Point
12%
Data Structure
61%
Density Estimation
24%
Dependent Data
24%
Dimensional Data
12%
Dimensional Space
36%
Dimensionality Reduction
61%
Distance Matrix
24%
Distinct Element
24%
Edge
87%
Eigenvalue
16%
Expander
24%
Higher Dimensions
24%
Histogram
24%
Kernel Density Estimation
32%
Laplace Operator
12%
Lindenstrauss
61%
Linear Space
12%
Low-Rank Approximation
32%
Lower and upper bounds
20%
Main Result
44%
Matching Problem
16%
Matrix (Mathematics)
48%
Matrix Algebra
24%
Median
24%
Nearest Neighbor
24%
Neural Network
48%
Numerical Linear Algebra
24%
Polynomial Time
24%
Property Testing
24%
Quantile
24%
Quantile
24%
Radius Graph
12%
Random Order
12%
Random Sample
24%
Real-World Data
24%
Reduction Method
12%
Relative Error
16%
Running Time
18%
Set Point
18%
Set Size
24%
Triangle
24%
Unstructured Text
24%
Upper Bound
14%
Worst Case
48%
Computer Science
Adjacency List Model
12%
Applied Machine Learning
12%
Approximated Matrix
12%
Approximation (Algorithm)
69%
Approximation Algorithms
20%
approximation factor
32%
Approximation Technique
12%
Bipartite Graph
30%
Computational Efficiency
12%
Computational Modeling
32%
Computer System
24%
Data Stream
48%
Dimensional Data
12%
Dimensional Data Set
12%
Dimensional Space
24%
Distance Matrix
24%
Efficient Algorithm
24%
Estimation Accuracy
24%
Estimation Algorithm
24%
Experimental Result
55%
Feature Vector
14%
Graph Neural Network
24%
Graph Theory
12%
High Dimensional Data
12%
Labeled Example
24%
Large Data Set
44%
Learning Algorithm
12%
Learning Space
24%
Locality Sensitive Hashing
24%
Log Management System
24%
Machine Learning
24%
Metric Space
12%
Multitasking
48%
Neighbour Search
48%
Network Architecture
12%
Neural Network
45%
Oblivious Algorithm
12%
polynomial-time algorithm
12%
Preprocessing Time
24%
Product Quantization
24%
Quantization (Signal Processing)
30%
Rank Approximation
48%
Run-to-Completion
12%
Search Algorithm
22%
Semisupervised Learning
24%
Space Complexity
22%
Sparsity
24%
Subgraphs
24%
System Administrator
24%
Theoretic Approach
24%
