Lower bound for deterministic semantic-incremental branching programs solving GEN
Dustin WehrPublished in: CoRR (2011)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- randomized algorithms
- branch and bound
- objective function
- semantic knowledge
- incremental learning
- semantic web
- optimal solution
- np hard
- semantic similarity
- semantic information
- domain specific
- semantic annotation
- co occurrence
- worst case
- sample complexity
- randomized algorithm
- sufficiently accurate
- domain ontology
- semantic network
- lagrangian relaxation
- high level
- polynomial approximation
- search algorithm for solving