On Wed, Apr 22, 2009 at 2:24 PM, Charles R Harris
wrote:
>
>
> On Mon, Apr 20, 2009 at 11:06 PM, Charles R Harris
> wrote:
>>
>>
>> On Mon, Apr 20, 2009 at 10:13 PM, David Cournapeau
>> wrote:
>>>
>>> Charles R Harris wrote:
>>>
>>> >
>>> > Here is a link to the start of the old discussion
>>> >
On Tue, Apr 21, 2009 at 11:24 PM, Charles R Harris <
charlesr.har...@gmail.com> wrote:
>
>
> On Mon, Apr 20, 2009 at 11:06 PM, Charles R Harris <
> charlesr.har...@gmail.com> wrote:
>
>>
>>
>> On Mon, Apr 20, 2009 at 10:13 PM, David Cournapeau <
>> da...@ar.media.kyoto-u.ac.jp> wrote:
>>
>>> Charl
On Mon, Apr 20, 2009 at 11:06 PM, Charles R Harris <
charlesr.har...@gmail.com> wrote:
>
>
> On Mon, Apr 20, 2009 at 10:13 PM, David Cournapeau <
> da...@ar.media.kyoto-u.ac.jp> wrote:
>
>> Charles R Harris wrote:
>>
>> >
>> > Here is a link to the start of the old discussion
>> > <
>> http://arti
sheer genius. Done in the blink of an eye and my original was taking 20
minutes!
Keith Goodman wrote:
> On 4/21/09, Mathew Yeates wrote:
>
>> Hi
>> I posted something about this earlier
>>
>> Say I have 2 arrays X and Y with shapes (N,3) where N is large
>> I am doing the following
>>
>> for
sheer genius. Done in the blink of an eye and my original was taking 20
minutes!
Keith Goodman wrote:
> On 4/21/09, Mathew Yeates wrote:
>
>> Hi
>> I posted something about this earlier
>>
>> Say I have 2 arrays X and Y with shapes (N,3) where N is large
>> I am doing the following
>>
>> for
sheer genius. Done in the blink of an eye and my original was taking 20
minutes!
Keith Goodman wrote:
> On 4/21/09, Mathew Yeates wrote:
>
>> Hi
>> I posted something about this earlier
>>
>> Say I have 2 arrays X and Y with shapes (N,3) where N is large
>> I am doing the following
>>
>> for
On 4/21/09, josef.p...@gmail.com wrote:
> On Tue, Apr 21, 2009 at 6:23 PM, Keith Goodman wrote:
>
>> On 4/21/09, Mathew Yeates wrote:
>> > Hi
>> > I posted something about this earlier
>> >
>> > Say I have 2 arrays X and Y with shapes (N,3) where N is large
>> > I am doing the following
>> >
>>
On Tue, Apr 21, 2009 at 6:23 PM, Keith Goodman wrote:
> On 4/21/09, Mathew Yeates wrote:
> > Hi
> > I posted something about this earlier
> >
> > Say I have 2 arrays X and Y with shapes (N,3) where N is large
> > I am doing the following
> >
> > for row in range(N):
> > result=polyfit(X[row,
On 4/21/09, Mathew Yeates wrote:
> Hi
> I posted something about this earlier
>
> Say I have 2 arrays X and Y with shapes (N,3) where N is large
> I am doing the following
>
> for row in range(N):
> result=polyfit(X[row,:],Y[row,:],1,full=True) # fit 3 points with a line
>
> This takes forever
On Tue, Apr 21, 2009 at 5:58 PM, Mathew Yeates wrote:
> Hi
> I posted something about this earlier
>
> Say I have 2 arrays X and Y with shapes (N,3) where N is large
> I am doing the following
>
> for row in range(N):
>result=polyfit(X[row,:],Y[row,:],1,full=True) # fit 3 points with a line
>
Hi
I posted something about this earlier
Say I have 2 arrays X and Y with shapes (N,3) where N is large
I am doing the following
for row in range(N):
result=polyfit(X[row,:],Y[row,:],1,full=True) # fit 3 points with a line
This takes forever and I was hoping to find a way to speed things up.
Russell E. Owen wrote:
> Christopher Barker wrote:
>> Has anyone submitted these patches so they'll get into bdist_mpkg? I'm
>> guessing Ronald Oussoren would be the person to accept them, but you can
>> post to the MacPython list to be sure.
>>
>> -Chris
>
> I have not, but would be happy to
Hi Nacer,
> I read your message on the african python tour mailing list. I am
> looking for someone able to help me find the right scientific package
> for parallel computing (data mining of frequent patterns). I am
> involve in a DEA course and need such a package to illustrate the
> topi
In article <49ecf2aa.8080...@noaa.gov>,
Christopher Barker wrote:
> Russell E. Owen wrote:
> >>> http://www.pymvpa.org/devguide.html
> >
> > The patch at the end of this document worked.
>
> Has anyone submitted these patches so they'll get into bdist_mpkg? I'm
> guessing Ronald Oussoren woul
14 matches
Mail list logo