search for: nbucket

Displaying 6 results from an estimated 6 matches for "nbucket".

Did you mean: bucket
2014 Oct 15
2
Test K-S con distribuciones LogNormales
...e es lo que comentas, en matemáticas no se suele llamar bucketización (este término se emplea más en informática) sino datos agrupados. Pero la idea es la que tu mismo dices. Respecto a las gráficas que has puesto, me han aclarado mucho sobre el tema, gracias. Si realizo lo mismo, por ejemplo con nbucket=1000 sigo obteniendo un p-valor de 1. Es decir, que casi le pongas lo que le pongas se obtiene un p-valor de 1. ¿Qué otros test de contraste de hipótesis me podrías recomendar? Porque igual ocurre lo que tu bien has dicho de que el test de K-S no es precisamente el mejor para este caso. Un salud...
2006 Feb 21
6
How to sum values across multiple variables using a wildcard?
I have a dataframe called "data" with 5 records (in rows) each of which has been scored on each of many variables (in columns). Five of the variables are named var1, var2, var3, var4, var5 using headers. The other variables are named using other conventions. I can create a new variable called var6 with the value 15 for each record with this code: > var6=var1+var2+var3+var4+var5
2010 Feb 11
3
[LLVMdev] FoldingSet #collisions comparison
...in MultiSource/Applications. Second: I've also tested lookup3 hash, and its use generated 0.1% more collisions, compared to SFH. These results were a bit surprising for me! Number of hash table resizes is independent of used hashing algorithm, because hash table grows when 'nentries > nbuckets * 2'. Gregory
2010 Feb 11
0
[LLVMdev] FoldingSet #collisions comparison
...Second: I've also tested lookup3 hash, and its use generated 0.1% more > collisions, compared to SFH. > > These results were a bit surprising for me! > > Number of hash table resizes is independent of used hashing algorithm, because > hash table grows when 'nentries > nbuckets * 2'. Thanks for doing the evaluation! It sounds like we should stay with SFH. In addition to fewer collisions, it is cheaper to compute. -Chris
2010 Feb 08
0
[LLVMdev] [PATCH] FoldingSetNodeID: use MurmurHash2 instead of SuperFastHash
On Feb 7, 2010, at 1:03 PM, Gregory Petrosyan wrote: > On Sat, Feb 06, 2010 at 04:51:15PM -0800, Chandler Carruth wrote: >> While I've not reviewed the patch in too much detail, it looks >> promising. Can you run some end-to-end benchmarks to make sure that >> cache pressure in the full program or other variables not accounted >> for in a micro-benchmark don't
2010 Feb 07
3
[LLVMdev] [PATCH] FoldingSetNodeID: use MurmurHash2 instead of SuperFastHash
On Sat, Feb 06, 2010 at 04:51:15PM -0800, Chandler Carruth wrote: > While I've not reviewed the patch in too much detail, it looks > promising. Can you run some end-to-end benchmarks to make sure that > cache pressure in the full program or other variables not accounted > for in a micro-benchmark don't dominate performance? Specifically the > nightly tester includes a number