Description:
Mathematical discussions and pursuits.
|
|
|
some help understanding a computational complexity
|
| |
I am trying to determine a "simpler" upper bound for ( a problem which
had the following comp complexity) :
sum ( for r = 2 to sqrt(n) ) of O( log( n / r) )
what can i say? Is this less than O(n^k1) or, better, less than
O(log(n)^k2) for some k1, k2 ?
What is a simpler tightest bound one can give for this complexity ?... more »
|
|
|
Limited Gravity...
|
| |
GR needs to become a limited strength force theory.
And all forces follow...
The math demonstrates it...
Stephen Hawking represented the math but went against it anyway.
Mitchell Raemsch; the dual prize
|
|
|
probability question
|
| |
Hello everyone,
I am trying to figure out some overall possibilities of some states
for a certain configuration and need a bit of help with probability
theory.
So, assume that there is an object that can take 3 states {0, 1, 2}
and the object can only change the state by doing one jump at a time.... more »
|
|
|
Recovering the Original Signal After Match Filtering On Excel
|
| |
This seems to work:
1. take the Fourier Transform (FFT) of the noisy signal and of the
kernel.
2. multiply the signal by the kernel [IMPRODUCT()]
3. Take the Inverse FFT (FFT^-1)
4. IMREAL()
5. The convolution will be inside out so cut it in half and splice
the edges to the center and the center to the edges.... more »
|
|
|
Comprehensive Test Banks for student
|
| |
Comprehensive Test Banks for student Email me at bestsellers.testbanks[at[gmail .com if you need to buy any test bank or solution manual listed below. All emails will be answered quickly. Use (CTRL + F) to search your subject/author.
Anything not in the list can also be made available.
Good follow up and service is our primary objective.... more »
|
|
|
