Displaying 3 results from an estimated 3 matches for "idealised".
2008 Oct 02
1
nls with plinear and function on RHS
Dear R gurus,
As part of finding initial values for a much more complicated fit I want to
fit a function of the form y ~ a + bx + cx^d to fairly "noisy" data and have
hit some problems.
To demonstrate the specific R-related problem, here is an idealised data
set, smaller and better fitting than reality:
# idealised data set
aDF <- data.frame( x= c(1.80, 9.27, 6.48, 2.61, 9.86, 5.93, 6.76, 5.52,
6.06, 8.62),
y= c(24.77, 2775.07, 895.15, 60.73, 3373.57, 677.82, 1021.92, 542.84,
725.25, 2200.04))
And here are some starting values, far better t...
2016 Mar 23
3
clustering technique using lsi
Hello sir,
You have interpreted correctly that clustering will be done by generating
the ring around the Document(i.e. the basic idea of LSI). But it is not
like increasing the radius and the next shell will be another cluster,
Rather it would pick one document (based on relevance score) and form a
ring around it to cluster the document, then from the remaining
documents(not in the cluster but
2014 Jun 27
3
[LLVMdev] [RFC] Add compiler scheduling barriers
On 24 June 2014 01:55, Philip Reames <listmail at philipreames.com> wrote:
>
> On 06/19/2014 09:35 AM, Yi Kong wrote:
>>
>> Hi all,
>>
>> I'm currently working on implementing ACLE extensions for ARM. There
>> are some memory barrier intrinsics, i.e.__dsb and __isb that require
>> the compiler not to reorder instructions around their