Login / Signup
The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity.
Hans-Joachim Böckenhauer
Juraj Hromkovic
Dennis Komm
Sacha Krug
Jasmin Smula
Andreas Sprock
Published in:
Electron. Colloquium Comput. Complex. (2012)
Keyphrases
</>
preprocessing
objective function
pairwise
clustering method
lower bound
experimental evaluation
high accuracy
segmentation method
detection method
model selection
computational cost
significant improvement
computational complexity
similarity measure
theoretical analysis
support vector machine svm
image sequences