<html>
<head>
<meta content="text/html; charset=UTF-8" http-equiv="Content-Type">
</head>
<body bgcolor="#FFFFFF" text="#000000">
<br>
<br>
<div class="moz-cite-prefix">On 06/04/2015 12:49 AM, Rick Sprague
wrote:<br>
</div>
<blockquote
cite="mid:CAAY+XR+qeQ-Jh5UMHR5BSrNnLV77fZfVjtt3QsjVxDcLcoH=qA@mail.gmail.com"
type="cite">
<div dir="ltr">
<div style="text-align:justify"><font color="#000000"
face="Droid Sans, Arial, Helvetica, Verdana"><span
style="font-size:12px;line-height:18px">Not sure if the
mailing list got my first message, but here goes...</span></font></div>
<div style="text-align:justify"><font color="#000000"
face="Droid Sans, Arial, Helvetica, Verdana"><span
style="font-size:12px;line-height:18px"><br>
</span></font></div>
<div style="text-align:justify"><font color="#000000"
face="Droid Sans, Arial, Helvetica, Verdana"><span
style="font-size:12px;line-height:18px">I have an input
that's a set of generators/vertices. I'd like to split
the input in two and compute hyper planes for each half.
How can I merge the two constraint systems to get a final
set of minimized constraints?</span></font></div>
<div style="text-align:justify"><font color="#000000"
face="Droid Sans, Arial, Helvetica, Verdana"><span
style="font-size:12px;line-height:18px"><br>
</span></font></div>
<div style="text-align:justify"><font color="#000000"
face="Droid Sans, Arial, Helvetica, Verdana"><span
style="font-size:12px;line-height:18px">Do I have to
basically processes the whole input at once? Or point me
to some literature that may address this (if it's actually
possible)? </span></font><span
style="font-size:12px;line-height:18px;color:rgb(0,0,0);font-family:'Droid
Sans',Arial,Helvetica,Verdana">I was hoping for a divide and
conquer type approach to computing constraints.</span></div>
<div style="text-align:justify"><font color="#000000"
face="Droid Sans, Arial, Helvetica, Verdana"><span
style="font-size:12px;line-height:18px"><br>
</span></font></div>
<div style="text-align:justify"><font color="#000000"
face="Droid Sans, Arial, Helvetica, Verdana"><span
style="font-size:12px;line-height:18px">Thanks,</span></font></div>
<div style="text-align:justify"><font color="#000000"
face="Droid Sans, Arial, Helvetica, Verdana"><span
style="font-size:12px;line-height:18px"><br>
</span></font></div>
<div style="text-align:justify"><font color="#000000"
face="Droid Sans, Arial, Helvetica, Verdana"><span
style="font-size:12px;line-height:18px">M</span></font></div>
</div>
<br>
<fieldset class="mimeAttachmentHeader"></fieldset>
<br>
<pre wrap="">_______________________________________________
PPL-devel mailing list
<a class="moz-txt-link-abbreviated" href="mailto:PPL-devel@cs.unipr.it">PPL-devel@cs.unipr.it</a>
<a class="moz-txt-link-freetext" href="http://www.cs.unipr.it/mailman/listinfo/ppl-devel">http://www.cs.unipr.it/mailman/listinfo/ppl-devel</a>
</pre>
</blockquote>
<br>
Hello Rick.<br>
<br>
Not completely sure regarding what you want to do here ...<br>
<br>
Anyway, if what you want is a divide&conquer algorithm for the
DD method, you can find some proposals in the literature. For
instance:<br>
<br>
Jevremovi ́c, D., Boley, D., Sosa, C.P.<br>
Divide-and-conquer approach to the parallel computation of
elementary flux modes in metabolic networks.<br>
In Parallel and Distributed Processing Workshops and Phd Forum, 2011<br>
<br>
At present, the PPL has no implementation of these algorithms. Also,
it is unclear whether or not these are able to obtain significant
performance gains for "common cases". You may want to have a look to
Chapter 7 of the disseration of Blagoy Genov:<br>
<br>
The Convex Hull Problem in Practice : Improving the Running Time of
the Double Description Method<br>
<a class="moz-txt-link-freetext" href="http://elib.suub.uni-bremen.de/edocs/00104422-1.pdf">http://elib.suub.uni-bremen.de/edocs/00104422-1.pdf</a><br>
<br>
<a target="_new"
href="http://elib.suub.uni-bremen.de/peid=D00104422">http://elib.suub.uni-bremen.de/peid=D00104422</a><br>
<br>
Regards,<br>
Enea Zaffanella.<br>
</body>
</html>