Sciweavers

503 search results - page 101 / 101
» Mining the optimal class association rule set
Sort
View
ICALP
2007
Springer
13 years 11 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
MMS
2008
13 years 5 months ago
Semantic interactive image retrieval combining visual and conceptual content description
We address the challenge of semantic gap reduction for image retrieval through an improved SVM-based active relevance feedback framework, together with a hybrid visual and concept...
Marin Ferecatu, Nozha Boujemaa, Michel Crucianu
STOC
2012
ACM
217views Algorithms» more  STOC 2012»
11 years 7 months ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...