2272 search results - page 97 / 455 » Capture Complexity by Partition |
140
click to vote
FUN
2007
Springer
16 years 14 days 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...
181
click to vote
GMP
2006
IEEE
16 years 10 days 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...
195
click to vote
WCRE
1999
IEEE
15 years 10 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...
141
click to vote
3DIM
2001
IEEE
15 years 10 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...
155
click to vote
AUTOMATICA
2010
15 years 6 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...