9842 search results - page 1618 / 1969 » The Complexity of the Matching-Cut Problem |
188
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...
177
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
176
click to vote
REFSQ
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. [Context and motivation] Ever-growing systems’ complexity and novel requirements engineering approaches such as reuse or globalization imply that requirements are produ...
210
click to vote
AUTONOMICS
2009
ACM
16 years 1 months ago
2009
ACM
Supervisory control is the main means to assure a high level performance and availability of large IT infrastructures. Applied control theory is used in physical and virtualization...
167
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...