13987 search results - page 319 / 2798 » The Two Guards Problem |
186
click to vote
COMPGEOM
1995
ACM
15 years 10 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
190
click to vote
VLDB
2004
ACM
16 years 2 days ago
2004
ACM
In a Web database that dynamically provides information in response to user queries, two distinct schemas, interface schema (the schema users can query) and result schema (the sch...
217
click to vote
SPIRE
2010
Springer
15 years 5 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
173
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
144
click to vote
BIRTHDAY
2009
Springer
16 years 1 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...