9842 search results - page 225 / 1969 » The Complexity of the Matching-Cut Problem |
ICML
2005
IEEE
14 years 11 months ago
2005
IEEE
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
COCOON
2009
Springer
14 years 5 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
CIBCB
2008
IEEE
14 years 5 months ago
2008
IEEE
— Molecular docking is an essential tool for drug design. It helps the scientist to rapidly know if two molecules, respectively called ligand and receptor, can be combined togeth...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Abstract--In this paper we construct low ML decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condit...
CACM
2006
13 years 10 months ago
2006
ional thinking is using abstraction and decomposition when attacking a large complex task or designing a large complex system. It is separation of concerns. It is choosing an appro...