843 search results - page 131 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
ICALP
2010
Springer
14 years 5 days ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— We consider nonlinear detection in rank-deficient multiple-antenna assisted beamforming systems. By exploiting the inherent symmetry of the underlying optimal Bayesian detecti...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...