16404 search results - page 715 / 3281 » A set coverage problem |
228
Voted
JSS
2006
15 years 7 months ago
2006
Model is a kind of codified knowledge that has been verified in solving problems. Solving a complex problem usually needs a set of models. Using components, the composition of a s...
189
click to vote
CORR
2002
Springer
15 years 7 months ago
2002
Springer
This paper addresses the problem of classifying observations when features are context-sensitive, especially when the testing set involves a context that is different from the tra...
199
click to vote
IPL
2008
15 years 6 months ago
2008
The Polar Diagram [1] of a set of points (i.e. sites) is a partition of the plane. It is a locus approach for problems processing angles. Also, Dynamic Polar Diagram problem is a ...
203
Voted
CSR
2009
Springer
16 years 1 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
204
click to vote
COMPGEOM
1995
ACM
15 years 11 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...