9842 search results - page 133 / 1969 » The Complexity of the Matching-Cut Problem |
176
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
148
click to vote
JITECH
2006
15 years 6 months ago
2006
The misalignment of information systems (IS) components with the rest of an organization remains a critical and chronic unsolved problem in today's complex and turbulent worl...
188
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
182
click to vote
WAIM
2010
Springer
15 years 4 months ago
2010
Springer
The increasing popularity of Community Web Management Systems (CWMSs) calls for tailor-made data management approaches for them. Still, existing CWMSs have mostly focused on simple...
139
click to vote
IEAAIE
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. This paper has as main goal to develop a hybrid expert system to minimize some of the complexity problems related to arti cial intelligence eld. For instance, we can ment...