464 search results - page 47 / 93 » Subsystem Based Generalizations of Rough Set Approximations |
103
Voted
WAPCV
2007
Springer
15 years 6 months ago
2007
Springer
Computational models of grounded language learning have been based on the premise that words and concepts are learned simultaneously. Given the mounting cognitive evidence for conc...
130
click to vote
TKDE
2011
14 years 6 months ago
2011
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
JMLR
2010
14 years 6 months ago
2010
We present a general method for explaining individual predictions of classification models. The method is based on fundamental concepts from coalitional game theory and prediction...
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...