Sciweavers

3250 search results - page 119 / 650
» An Algorithm to Solve a Linear Program
Sort
View
152
Voted
HIS
2008
15 years 4 months ago
Multiple Instance Learning with MultiObjective Genetic Programming for Web Mining
This paper introduces a multiobjective grammar based genetic programming algorithm to solve a Web Mining problem from multiple instance perspective. This algorithm, called MOG3P-MI...
Amelia Zafra, Eva Lucrecia Gibaja Galindo, Sebasti...
118
Voted
APPROX
2010
Springer
189views Algorithms» more  APPROX 2010»
15 years 2 months ago
Approximating Sparsest Cut in Graphs of Bounded Treewidth
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
Eden Chlamtac, Robert Krauthgamer, Prasad Raghaven...
123
Voted
DAGSTUHL
2008
15 years 4 months ago
Improving the Performance of a Verified Linear System Solver Using Optimized Libraries and Parallel Computation
Abstract. A parallel version of the self-verified method for solving linear systems was presented in [19, 18]. In this research we propose improvements aiming at a better performan...
Mariana Luderitz Kolberg, Gerd Bohlender, Dalcidio...
133
Voted
ICML
2009
IEEE
16 years 3 months ago
Convex variational Bayesian inference for large scale generalized linear models
We show how variational Bayesian inference can be implemented for very large generalized linear models. Our relaxation is proven to be a convex problem for any log-concave model. ...
Hannes Nickisch, Matthias W. Seeger
MP
2006
119views more  MP 2006»
15 years 2 months ago
Approximate extended formulations
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
Mathieu Van Vyve, Laurence A. Wolsey