Sciweavers

2652 search results - page 53 / 531
» Privacy-preserving linear programming
Sort
View
ANNPR
2006
Springer
15 years 1 months ago
Fast Training of Linear Programming Support Vector Machines Using Decomposition Techniques
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
Yusuke Torii, Shigeo Abe
PARA
1995
Springer
15 years 1 months ago
Decomposing Linear Programs for Parallel Solution
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...
Ali Pinar, Ümit V. Çatalyürek, Ce...
IJCAI
2007
14 years 11 months ago
Using Linear Programming for Bayesian Exploration in Markov Decision Processes
A key problem in reinforcement learning is finding a good balance between the need to explore the environment and the need to gain rewards by exploiting existing knowledge. Much ...
Pablo Samuel Castro, Doina Precup
DAM
2007
91views more  DAM 2007»
14 years 9 months ago
Integer linear programming approaches for non-unique probe selection
In addition to their prevalent use for analyzing gene expression, DNA microarrays are an efficient tool for biological, medical, and industrial applications because of their abil...
Gunnar W. Klau, Sven Rahmann, Alexander Schliep, M...
MP
2006
84views more  MP 2006»
14 years 9 months ago
Optimal 3-terminal cuts and linear programming
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
Kevin K. H. Cheung, William H. Cunningham, Lawrenc...