Abstract. In this paper, we propose that the select operator in relational databases be adopted for incorporating evidence in Bayesian networks. This approach does not involve the ...
We introduce k-star-shaped polygons, polygons for which there exists at least one point x such that for any point y of the polygon, segment xy crosses the polygon's boundary ...
We consider the problem of constructing a directed acyclic graph that encodes temporal relations found in a text. The unit of our analysis is a temporal segment, a fragment of tex...
Philip Bramsen, Pawan Deshpande, Yoong Keok Lee, R...
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
We consider the challenge of preference elicitation in systems that help users discover the most desirable item(s) within a given database. Past work on preference elicitation foc...