2272 search results - page 97 / 455 » Capture Complexity by Partition |
FUN
2007
Springer
15 years 4 months ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
GMP
2006
IEEE
15 years 4 months ago
2006
IEEE
In this paper, we propose to combine Kazhdan’s FFT-based approach to surface reconstruction from oriented points with adaptive subdivision and partition of unity blending techni...
WCRE
1999
IEEE
15 years 2 months ago
1999
IEEE
We present a technique for restructuring functions with low cohesion into functions with high cohesion. Such restructuring is desirable when re-architecting a legacy system into a...
3DIM
2001
IEEE
15 years 1 months ago
2001
IEEE
Analysis and reconstruction of range images usually focuses on complex objects completely contained in the field of view; little attention has been devoted so far to the reconstru...
AUTOMATICA
2010
14 years 10 months ago
2010
This paper presents three novel Moving Horizon Estimation (MHE) methods for discrete-time partitioned linear systems, i.e. systems decomposed into coupled subsystems with non-over...