Hi,
On Fri, Aug 17, 2012 at 2:25 PM, Sayth Renshaw wrote:
>>
>> Hi Sayth,
>>
>> On Thu, Aug 16, 2012 at 8:51 PM, Sayth Renshaw
>> wrote:
>>> Hi
>>>
>>> I was just wondering if the current absence of 64bit builds was as a result
>>> of an infrastructure or funding concern.
>>>
>>> I like many no
Donations to NumFOCUS would be helpful in raising money to fund the creation of
64-bit installers.It always comes down to funding, but mostly people's time
is the scarce resource here.
It is more difficult to build 64-bit binaries on Windows which is the real
issue (not the availability
>
> Hi Sayth,
>
> On Thu, Aug 16, 2012 at 8:51 PM, Sayth Renshaw wrote:
>> Hi
>>
>> I was just wondering if the current absence of 64bit builds was as a result
>> of an infrastructure or funding concern.
>>
>> I like many now have only 64 bit systems and am using the unofficial builds.
>>
>> If it
On Thu, Aug 16, 2012 at 11:14 PM, nicky van foreest wrote:
> Your problem seems to resemble a Bayesian network. (The wikipedia page
> on this topic is not particularly revealing in my opinion BTW.)
>
The courses of Sebastian Thrun on Artificial Intelligence both at Stanford
or at Udacity are fre
I've been implementing a native C++ code with all of the functionality of
the Python Uncertanties package (http://packages.python.org/uncertainties/).
Automatic error propagation (and differentiation) is extremely useful, but
native speed is needed to use in things like function fitting.
I have cr
Hi Sayth,
On Thu, Aug 16, 2012 at 8:51 PM, Sayth Renshaw wrote:
> Hi
>
> I was just wondering if the current absence of 64bit builds was as a result
> of an infrastructure or funding concern.
>
> I like many now have only 64 bit systems and am using the unofficial builds.
>
> If it was something
Just to be sure every body know, the hardware division is always
slower then the hardware multiplication. Doing division is much more
complex, so it need more circuitery and can't be pipelined. So we
can't reuse part of the circuitery in parallel. So hardware division
will always be slower then har
Hi,
On 16 August 2012 19:38, Sebastian Berg wrote:
> Hello,
>
> Just to throw it in, if you do not mind useing scipy, you can use its
> multidimensional correlate method instead:
>
Well, I don't need to count the number of neighbours as in the linked
example. What I wanted to have is easy acces
