Sciweavers

350 search results - page 10 / 70
» Separation of Partition Inequalities
Sort
View
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
14 years 2 months ago
Separating Populations with Wide Data: A Spectral Analysis
In this paper, we consider the problem of partitioning a small data sample drawn from a mixture of k product distributions. We are interested in the case that individual features a...
Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuh...
IPCO
2008
188views Optimization» more  IPCO 2008»
13 years 9 months ago
Binary Positive Semidefinite Matrices and Associated Integer Polytopes
We consider the positive semidefinite (psd) matrices with binary entries. We give a characterisation of such matrices, along with a graphical representation. We then move on to co...
Adam N. Letchford, Michael M. Sørensen
STOC
2006
ACM
106views Algorithms» more  STOC 2006»
14 years 8 months ago
Finding small balanced separators
Let G be an n-vertex graph that has a vertex separator of size k that partitions the graph into connected components of size smaller
Uriel Feige, Mohammad Mahdian
CORR
2011
Springer
144views Education» more  CORR 2011»
13 years 2 months ago
On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function
— Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we ...
Mehdi Molkaraie, Payam Pakzad
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 7 months ago
Separable convex optimization problems with linear ascending constraints
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...
Arun Padakandla, Rajesh Sundaresan