3225 search results - page 230 / 645 » Measures of Similarity |
129
click to vote
COCO
1995
Springer
15 years 5 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
FLAIRS
2006
15 years 3 months ago
2006
Two measures of lexical cohesion were developed and applied to a corpus of human-computer tutoring dialogs. For both measures, the amount of cohesion in the tutoring dialog was fo...
118
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
We present a nonparametric Bayesian model for multi-task learning, with a focus on feature selection in binary classification. The model jointly identifies groups of similar tas...
138
click to vote
CVPR
2005
IEEE
16 years 4 months ago
2005
IEEE
While spectral clustering has been applied successfully to problems in computer vision, their applicability is limited to pairwise similarity measures that form a probability matr...
103
click to vote
AI
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In the context of the RoboCup Simulation League, we describe a new representation of a software agent’s visual perception (“scene”), well suited for case-based reas...