183 search results - page 2 / 37 » Complete Minors and Independence Number |
COMPGEOM
2011
ACM
12 years 9 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
STOC
1990
ACM
13 years 9 months ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
ICA
2010
Springer
13 years 6 months ago
2010
Springer
Independent Component Analysis is the best known method for solving blind source separation problems. In general, the number of sources must be known in advance. In many cases, pre...
CRYPTO
2006
Springer
13 years 9 months ago
2006
Springer
In the setting of multiparty computation, a set of parties wish to jointly compute a function of their inputs, while preserving security in the case that some subset of them are co...