681 search results - page 35 / 137 » General Polynomial Time Decomposition Algorithms |
104
Voted
CCE
2004
15 years 2 months ago
2004
This paper describes an optimization procedure for the synthesis of complex distillation configurations. A superstructure based on the Reversible Distillation Sequence Model (RDSM...
105
click to vote
JCB
2007
15 years 2 months ago
2007
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
132
click to vote
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
162
Voted
MLDM
2010
Springer
14 years 9 months ago
2010
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
137
Voted
COMPGEOM
2003
ACM
15 years 8 months ago
2003
ACM
We propose a novel type of decomposition for polygonal shapes. It is thought that, for the task of object recognition, the human visual system uses a part-based representation. De...