928 search results - page 32 / 186 » Complexity of Self-assembled Shapes |
KR
2010
Springer
14 years 19 days ago
2010
Springer
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Dirty paper coding (DPC) refers to methods for pre-subtraction of known interference at the transmitter of a multiuser communication system. There are numerous applications for DPC...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
Active shape models are a powerful and widely used tool to interpret complex image data. By building models of shape variation they enable search algorithms to use a priori knowle...
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
— This paper addresses the problem of efficiently computing robot navigation functions. Navigation functions are potential functions free of spurious local minima that present a...
CVIU
2006
13 years 8 months ago
2006
A novel approach is proposed to analyzing and tracking the motion of structured deformable shapes, which consist of multiple correlated deformable subparts. Since this problem is ...