350 search results - page 8 / 70 » Separation of Partition Inequalities |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time. We integrate the propagat...
CCCG
2006
13 years 9 months ago
2006
We study the graph partitioning problem on ddimensional ball graphs in a geometric way. Let B be a set of balls in d-dimensional Euclidean space with radius ratio and -precision....
CORR
2004
Springer
13 years 7 months ago
2004
Springer
The conventional definition of a topological metric over a space specifies properties that must be obeyed by any measure of "how separated" two points in that space are....