We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
When we describe a Web page informally, we often use phrases like it looks like a newspaper site", there are several unordered lists" or it's just a collection of li...
Isabel F. Cruz, Slava Borisov, Michael A. Marks, T...
This paper describes a series of experiments that were performed on the Rocky III robot.1 Rocky III is a small autonomous rover capable of navigating through rough outdoor terrain...
David P. Miller, Rajiv S. Desai, Erann Gat, Robert...
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
In the area of image retrieval, post-retrieval processing is often used to refine the retrieval results to better satisfy users’ requirements. Previous methods mainly focus on p...