High-dimensional data usually incur learning deficiencies and computational difficulties. We present a novel semi-supervised dimensionality reduction technique that embeds high-dim...
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
An overlay network is formed on top of – and generally independently from – the underlying physical computer network, by the peers (nodes) of a P2P system. The dynamics of pee...
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grando...
The usage and service options of a pubic network generally differ from a private (enterprise or home) network and consequently, the two networks are often configured differently. ...