1640 search results - page 313 / 328 » Conditional Independence Trees |
AAAI
2008
15 years 2 months ago
2008
In several applications of logic programming and Transaction Logic, such as, planning, trust management and independent Semantic Web Services, an action might produce incomplete f...
108
click to vote
DLOG
2007
15 years 2 months ago
2007
Abstract. Concept approximation is an inference service for Description Logics that provides “translations” of concept descriptions from one DL to a less expressive DL. In [4] ...
109
click to vote
CPM
2005
Springer
15 years 1 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
116
click to vote
CIKM
2007
Springer
15 years 1 months ago
2007
Springer
One aspect in which retrieving named entities is different from retrieving documents is that the items to be retrieved – persons, locations, organizations – are only indirect...
COLT
2008
Springer
15 years 1 months ago
2008
Springer
Consider the problem of estimating the -level set G = {x : f(x) } of an unknown d-dimensional density function f based on n independent observations X1, . . . , Xn from the densi...