9842 search results - page 167 / 1969 » The Complexity of the Matching-Cut Problem |
119
click to vote
ECML
1993
Springer
15 years 7 months ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
131
click to vote
WSCG
2004
15 years 4 months ago
2004
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
133
click to vote
AI
2006
Springer
15 years 3 months ago
2006
Springer
We study Coalitional Resource Games (CRGs), a variation of Qualitative Coalitional Games (QCGs) in which each agent is endowed with a set of resources, and the ability of a coalit...
110
click to vote
IJHPCA
2006
15 years 3 months ago
2006
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...
139
click to vote
TSP
2008
15 years 2 months ago
2008
The two-band discrete wavelet transform (DWT) provides an octave-band analysis in the frequency domain, but this might not be "optimal" for a given signal. The discrete w...