2254 search results - page 18 / 451 » Computing the minimal covering set |
ICRA
2005
IEEE
14 years 3 months ago
2005
IEEE
— In this paper we address the problem of generating a motion strategy to find an object in a known 3-D environment as quickly as possible on average. We use a sampling scheme t...
DAM
1999
13 years 9 months ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
DCC
2006
IEEE
14 years 9 months ago
2006
IEEE
It is shown that in some cases it is possible to reconstruct a block design D uniquely from incomplete knowledge of a minimal defining set for D. This surprising result has implic...
GC
2007
Springer
13 years 9 months ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
128
click to vote
Tutorial
An easy to follow tutorial that covers the implementation details of the Narrow Band Level Set Method. It also covers the numerical approximation for PDEs governing different types...