6833 search results - page 360 / 1367 » Some two-character sets |
173
click to vote
ISNN
2007
Springer
16 years 1 months ago
2007
Springer
Manifold learning algorithms have been proven to be capable of discovering some nonlinear structures. However, it is hard for them to extend to test set directly. In this paper, a ...
168
click to vote
KSEM
2007
Springer
16 years 29 days ago
2007
Springer
Abstract. Description logics (DLs) are a well-known family of knowledge representation (KR) languages. The notation of DLs has the style of a variable-free first order predicate l...
162
click to vote
LPNMR
2007
Springer
16 years 29 days ago
2007
Springer
In this paper by considering an answer set programming approach and some basic ideas from possibilistic logic, we introduce a possibilistic disjunctive logic programming approach t...
153
click to vote
POLICY
2007
Springer
16 years 29 days ago
2007
Springer
Among the many works on trust negotiation, only a few deal with negotiation strategies. These works are tailored to specific frameworks—so their results cannot be extended to c...
182
click to vote
SEKE
2007
Springer
16 years 29 days ago
2007
Springer
Some machine learning applications are intended to learn properties of data sets where the correct answers are not already known to human users. It is challenging to test such ML ...