<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Recent changes to Home</title><link>https://sourceforge.net/p/binmatrix/wiki/Home/</link><description>Recent changes to Home</description><atom:link href="https://sourceforge.net/p/binmatrix/wiki/Home/feed" rel="self"/><language>en</language><lastBuildDate>Thu, 18 Jun 2015 02:02:55 -0000</lastBuildDate><atom:link href="https://sourceforge.net/p/binmatrix/wiki/Home/feed" rel="self" type="application/rss+xml"/><item><title>Discussion for Home page</title><link>https://sourceforge.net/p/binmatrix/wiki/Home/</link><description>&lt;div class="markdown_content"&gt;&lt;p&gt;A graph of times in my computer is (another attachment):&lt;/p&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Daniel Tomas Karl</dc:creator><pubDate>Thu, 18 Jun 2015 02:02:55 -0000</pubDate><guid>https://sourceforge.net111b355d18916b7e2941d614af2c245c9583dd86</guid></item><item><title>Discussion for Home page</title><link>https://sourceforge.net/p/binmatrix/wiki/Home/</link><description>&lt;div class="markdown_content"&gt;&lt;p&gt;BinMatrix is a class to operating and storing binary matrices. Each BinMatrix object represent a binary matrix. Supported operations are OR,AND, product and  power among others.&lt;br /&gt;
This class is intented to be used inside a  C++ program. Documentation for this class can be found at attachment&lt;br /&gt;
At present time,  this is the third version of the binary matrix class system.&lt;br /&gt;
C++11 is used and there are some dependencies on Qt (4.8 or higher).&lt;br /&gt;
In order to use it you need Qt and its classes (including &amp;lt;gui&amp;gt;) for creating a makefile and compiling it. &lt;br /&gt;
BinMatrix aims to a better data organization  in order to speed up calculations. It can be adjusted to your needs. To learn more read "BinMatrix guide for programmers". This class is optimized to process binary matrices and it can perform some operations very quickly. For example products of binary matrices are very fast. An example illustrating this is the product of two random matrices composed of a 25% of 1's and a 75% of 0's, his calculation times in a Intel Core i7-4770 CPU@3.40Ghz and 3.8 Gb of memory are :&lt;br /&gt;
- size 2000x2000 : 0.1 seconds&lt;br /&gt;
- size 4000x4000 : 0.48 seconds&lt;br /&gt;
- size 6000x6000 : 2.3 seconds&lt;br /&gt;
- size 8000x8000 : 3.4 seconds&lt;br /&gt;
- size 10000x10000 : 8-9.3 seconds&lt;br /&gt;
Timings in general have a O(N^3)  (N is size of matrix).&lt;br /&gt;
A graph of times in my computer is (another attachment):&lt;/p&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Daniel Tomas Karl</dc:creator><pubDate>Thu, 18 Jun 2015 02:00:43 -0000</pubDate><guid>https://sourceforge.net059e6e980256480bf442f4c7b4e707f9a5a12332</guid></item><item><title>Home modified by Daniel Tomas Karl</title><link>https://sourceforge.net/p/binmatrix/wiki/Home/</link><description>&lt;div class="markdown_content"&gt;&lt;p&gt;Welcome to your wiki!&lt;/p&gt;
&lt;p&gt;This is the default page, edit it as you see fit. To add a new page simply reference it within brackets, e.g.: &lt;span&gt;[SamplePage]&lt;/span&gt;.&lt;/p&gt;
&lt;p&gt;The wiki uses &lt;a class="" href="/p/binmatrix/wiki/markdown_syntax"&gt;Markdown&lt;/a&gt; syntax.&lt;/p&gt;
&lt;p&gt;&lt;h6&gt;Project Members:&lt;/h6&gt;
&lt;ul class="md-users-list"&gt;
&lt;li&gt;&lt;a href="/u/danjiunsource"&gt;Daniel Tomas Karl&lt;/a&gt; (admin)&lt;/li&gt;
&lt;/ul&gt;&lt;br /&gt;
&lt;/p&gt;&lt;p&gt;&lt;span class="download-button-55822103f1fd8d04dbb385ba" style="margin-bottom: 1em; display: block;"&gt;&lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Daniel Tomas Karl</dc:creator><pubDate>Thu, 18 Jun 2015 01:38:11 -0000</pubDate><guid>https://sourceforge.net5ebcd6f5f29572519d6a7de4aff877cb558cd085</guid></item></channel></rss>