151 search results - page 19 / 31 » The max quasi-independent set Problem |
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
CP
2008
Springer
13 years 10 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
JCST
2008
13 years 8 months ago
2008
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
ACCV
2006
Springer
14 years 2 months ago
2006
Springer
Performing segmentation of narrow, elongated structures with low contrast boundaries is a challenging problem. Boundaries of these structures are difficult to be located when noise...
JMLR
2006
13 years 8 months ago
2006
Support vector machines (SVMs), though accurate, are not preferred in applications requiring great classification speed, due to the number of support vectors being large. To overc...