We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustivene...
We study the efficient evaluation of top-k queries over data items, where the score of each item is dynamically computed by applying an item-specific function whose parameter valu...
Lin Guo, Sihem Amer-Yahia, Raghu Ramakrishnan, Jay...
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldm...
— Probabilistic sampling-based motion planners are unable to detect when no feasible path exists. A common heuristic is to declare a query infeasible if a path is not found in a ...
Kris K. Hauser, Timothy Bretl, Jean-Claude Latombe
Relevance feedback has been considered as a means of incorporating learning into information retrieval systems for quite sometime now. This paper discusses the research results of...