Dörfler marking with minimal cardinality is a linear complexity problem.

Carl-Martin Pfeiler Dirk Praetorius

Published in: CoRR (2019)

Keyphrases

linear complexity
linear computational complexity
real time
neural network
relational databases
symmetric difference
database
computer vision
multi agent
data structure
natural language
digital libraries
artificial neural networks
multiresolution
probabilistic model
cardinality constraints