3244 search results - page 271 / 649 » On convex complexity measures |
196
click to vote
MM
2004
ACM
16 years 2 days ago
2004
ACM
It has been established that active learning is effective for learning complex, subjective query concepts for image retrieval. However, active learning has been applied in a conc...
170
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
170
click to vote
NIPS
2008
15 years 8 months ago
2008
We address the challenge of assessing conservation of gene expression in complex, non-homogeneous datasets. Recent studies have demonstrated the success of probabilistic models in...
177
click to vote
JUCS
2002
15 years 6 months ago
2002
: We consider disjunctive sequences, that is, infinite sequences (-words) having all finite words as infixes. It is shown that the set of all disjunctive sequences can be described...
177
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...