Explore >> Select a destination
|
You are here 
|
finnstats.com | ||
| | | | |
www.johnmyleswhite.com
|
|
| | | | | I'm currently reading Luce's "Response Times". If you don't know anything about response times, they are very easily defined: a response time is the length of time it takes a person to respond to a simple request, measured from the moment when the request is made to the moment when the person's response is recorded. In principle, you can measure response times when asking people to indicate that they've heard a tone as easily as you can measure them when you've asked people to solve a problem in calculus. | |
| | | | |
poissonisfish.com
|
|
| | | | | Someof the most fundamental functions in R, in my opinion, are those that deal with probability distributions. Whenever you compute a P-value you relyon a probability distribution, and there are many types out there. In this exercise I will cover four: Bernoulli, Binomial, Poisson, and Normal distributions. Let me begin with some theory first: Bernoulli... | |
| | | | |
www.randomservices.org
|
|
| | | | | ||
| | | | |
lucatrevisan.wordpress.com
|
|
| | | We now discuss how to view proofs of certain regularity lemmas as applications of the FTRL methodology. The Szemeredi Regularity Lemma states (in modern language) that every dense graph is well approximate by a graph with a very simple structure, made of the (edge-disjoint) union of a constant number of weighted complete bipartite subgraphs. The... | ||
