A high-order quadrature algorithm is presented for computing integrals over curved surfaces and volumes whose geometry implicitly defined by the level sets of (one or more) multivariate polynomials. The recasts as graph an defined, multi-valued height function, applies a dimension reduction approach needing only one-dimensional quadrature. In particular, we explore use Gauss-Legendre tanh-sinh ...

This communication puts forward a novel method for independent source extraction in instantaneous linear mixtures. The method is based on the conditional mean of the whitened observations and requires some prior knowledge of the positive support of the desired source. A theoretical performance analysis yields the closed-form expression of the asymptotic interference-to-signal ratio (ISR) achiev...

Given a graph G = (V, E) and a positive integer k, in MAXIMUM k-ORDER BOUNDED COMPONENT SET (MAX-k-OBCS), it is required to find a vertex set S ⊆ V of maximum size such that each component in the induced graph G[S] has at most k vertices. We prove that for constant k, MAX-k-OBCS is hard to approximate within a factor of n1−e, for any e > 0, unless P = NP. This is an improvement on the previous ...

In the `-Component Order Connectivity problem (` ∈ N), we are given a graph G on n vertices, m edges and a non-negative integer k and asks whether there exists a set of vertices S ⊆ V (G) such that |S| ≤ k and the size of the largest connected component in G−S is at most `. In this paper, we give a kernel for `-Component Order Connectivity with at most 2`k vertices that takes nO(`) time for eve...