86 search results - page 15 / 18 » Generalized Balanced Partitions of Two Sets of Points in the... |
WEBI
2010
Springer
13 years 6 months ago
2010
Springer
High-dimensional data usually incur learning deficiencies and computational difficulties. We present a novel semi-supervised dimensionality reduction technique that embeds high-dim...
JCT
2008
13 years 8 months ago
2008
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...
ICDCSW
2006
IEEE
14 years 2 months ago
2006
IEEE
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...
LATIN
2010
Springer
14 years 3 months ago
2010
Springer
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...
USITS
2001
13 years 9 months ago
2001
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. ...