Sciweavers

962 search results - page 38 / 193
» Near-optimal solutions for the generalized max-controlled se...
Sort
View
APN
2011
Springer
14 years 1 months ago
On the Origin of Events: Branching Cells as Stubborn Sets
In prime event structures with binary conflicts (pes-bc)3 a branching cell [1] is a subset of events closed under downward causality and immediate conflict relations. This means ...
Henri Hansen, Xu Wang
CVIU
2008
109views more  CVIU 2008»
14 years 10 months ago
Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual st
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios
TSMC
2008
81views more  TSMC 2008»
14 years 9 months ago
Role Transfer Problems and Algorithms
Role transfer is a usual activity in an organization, especially in a crisis situation. Role assignment and transfer regulations are important to accomplish it. This paper discusse...
Haibin Zhu, MengChu Zhou
AAAI
2011
13 years 10 months ago
Convex Sparse Coding, Subspace Learning, and Semi-Supervised Extensions
Automated feature discovery is a fundamental problem in machine learning. Although classical feature discovery methods do not guarantee optimal solutions in general, it has been r...
Xinhua Zhang, Yaoliang Yu, Martha White, Ruitong H...
MP
1998
109views more  MP 1998»
14 years 9 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra