13987 search results - page 118 / 2798 » The Two Guards Problem |
105
click to vote
SODA
1996
ACM
15 years 4 months ago
1996
ACM
The Maximum Agreement Subtree problem is the following: given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these i...
112
Voted
MANSCI
2006
15 years 3 months ago
2006
This paper presents a new information acquisition problem motivated by business applications where customer data has to be acquired with a specific modeling objective in mind. In ...
105
Voted
ICCSA
2003
Springer
15 years 8 months ago
2003
Springer
In this paper we study the problems of separability of two disjoint point sets in 3D by multiple criteria extending some notions on separability of two disjoint point sets in the ...
CCCG
2010
15 years 4 months ago
2010
Given k labelings of a finite d-dimensional grid, define the combined distance between two labels to be the sum of the 1-distance between the two labels in each labeling. We prese...
105
Voted
CCCG
2007
15 years 4 months ago
2007
Let P be a set of n points in the plane. A connecting line of P is a line that passes through at least two of its points. A connecting line is called ordinary if it is incident on...