Computer Science
Approximate Algorithm
29%
Big Data
37%
bipartite matching
29%
Computer Standard
29%
Concurrency
29%
Concurrency Control
22%
Data Model
19%
Data Structure
100%
Database Systems
51%
Distributed Algorithm
29%
Distributed Processing
29%
Experimental Result
41%
Good Performance
22%
Hill Climbing
29%
Labelled Graph
29%
Large Data Set
22%
Learning Algorithm
19%
Machine Learning
96%
Matching Strategy
29%
Mining Technique
19%
multi-processor
19%
Negative Example
29%
Network File System
29%
on-line algorithm
27%
Ontology
19%
Parallel Database
22%
Parallelism
44%
Pattern Matching
41%
Performance Time
29%
Query Language
59%
Query Processing
37%
Query Similarity
29%
Real Time Systems
44%
Reproducibility
49%
Reproducible Experiment
22%
Scheduling Algorithm
44%
Scientific Data
29%
Sensitive Informations
29%
Sequence Alignment
34%
Sliding Window
24%
Structured Query Language
24%
Subgraph Isomorphism
38%
Subgraphs
69%
Subscribe System
44%
task-scheduling
29%
Time Efficiency
29%
Underlying Hardware
29%
Use Case
19%
Variable Length
29%
Wildcard
29%
Keyphrases
Binary Values
29%
Booby
14%
Competitive Online Algorithm
29%
Computational pipeline
29%
Data-driven Optimization
29%
Database Tuning
14%
Debugging
44%
Edit Distance
22%
Error-prone
25%
Evidence-based Algorithm
29%
Film Postproduction
14%
Graph Isomorphism
44%
Graph Matching
34%
Heuristic-based
23%
High Performance
17%
Homology Search
29%
Human Thinking
22%
Machine Learning Tasks
22%
Matching Strategy
29%
Multiple Datasets
22%
Multiprocessor
14%
Online Algorithms
17%
Online Scheduling
25%
Online Scheduling Algorithm
37%
Order-dependent
29%
Ordered Data
14%
Ordered Labelled Trees
22%
Overloaded Systems
14%
Parallelization
22%
Pattern Graph
32%
Pattern Matching
25%
Pattern Recognition
16%
Publish-subscribe Systems
29%
Query Language
25%
Real-time Systems
44%
RNA Secondary Structure
18%
Scheduler
19%
Scientific Enterprise
22%
Scientific Experiments
22%
Similarity Query
19%
Simulation-based Learning
22%
Sporadic Tasks
14%
System Scheduling
29%
Treasure
14%
Two-tree
22%
Uniprocessor
22%
Unordered Trees
29%
Value Density
18%
Workability
29%
Worst-Case Guarantees
29%