🔒 Locked
TIOA
Advertisement
Original Post
I have posted an article on my website @
http://www.optionalreaction.net/neuralheap/tioa/tioa.htm
It's a method to compress data to a previously undescribed level.
R
"The truth approaches, but not at full speed"
EDIT: Fix the damn HTML
[edited by - reaction on December 2, 2002 7:00:52 AM]
website at.....
where, where I must know where its at!
EDIT: you mean this website?
optionalreaction.net
[edited by - googlyeyes on December 1, 2002 10:22:44 PM]
where, where I must know where its at!
EDIT: you mean this website?
optionalreaction.net
[edited by - googlyeyes on December 1, 2002 10:22:44 PM]
quote:
Original post by googlyeyes
website at.....
where, where I must know where its at!
EDIT: you mean this website?
optionalreaction.net
[edited by - googlyeyes on December 1, 2002 10:22:44 PM]
duh! Anybody that has 5 cents worth of sense could see...
[Cyberdrek | the last true sorcerer | Spirit Mage - mutedfaith.com]
He means this. He made a small error with his html...
People have thought of that technique before. Since no-one is using it, I'd conclude that it isn't any good.
You seem to be making a habit of this... please, don't announce that you have a good idea until you've got solid grounds for the claim.
EDIT:
By the way, the average difference is approximately 1431655765, not 65536.
[edited by - Beer Hunter on December 1, 2002 10:50:07 PM]
People have thought of that technique before. Since no-one is using it, I'd conclude that it isn't any good.
You seem to be making a habit of this... please, don't announce that you have a good idea until you've got solid grounds for the claim.
EDIT:
By the way, the average difference is approximately 1431655765, not 65536.
[edited by - Beer Hunter on December 1, 2002 10:50:07 PM]
Beer Hunter,
Thanks for your reply.
The difference maths could well be wrong ... this is what I did ...
The max difference is 4 billion (32 bits)
The probable average difference is (32 / 2) = 16 bits = 65,536
The claims are not unsubstantiated, the compression rate of the first loop was ~67%, and if that is the case, recursively the output will be v. small.
The only reason I can think for no-one ever using it before, is #undefined.
Thanks,
R
Thanks for your reply.
The difference maths could well be wrong ... this is what I did ...
The max difference is 4 billion (32 bits)
The probable average difference is (32 / 2) = 16 bits = 65,536
The claims are not unsubstantiated, the compression rate of the first loop was ~67%, and if that is the case, recursively the output will be v. small.
The only reason I can think for no-one ever using it before, is #undefined.
Thanks,
R
You''re taking the square root of of (max - min). Why? How is that going to give the average difference?
Look at your conclusion... and consider what would happen if you scaled max and min linearly. The average difference must scale linearly too... but it doesn''t under your model.
The expected difference will always be one third of (max - min), and it''s fairly easy to write a program to test that.
Probably, the reason that you obtained such high "compression" was because of an error in your code. This has happened before. Before you can conclude that your compressor works, you must write a decompressor.
Look at your conclusion... and consider what would happen if you scaled max and min linearly. The average difference must scale linearly too... but it doesn''t under your model.
The expected difference will always be one third of (max - min), and it''s fairly easy to write a program to test that.
Probably, the reason that you obtained such high "compression" was because of an error in your code. This has happened before. Before you can conclude that your compressor works, you must write a decompressor.
reaction: Lemme try and help you bud, and this is some honest advice. Please please please before you go off telling everyone how you''ve solved a problem that many programmer types have been number crunching over for decades, take a step back, examine it from all angles, and maybe show it to your nearest math professor. It would save you a lot of aggrivation from the forums.
-Ryan "Run_The_Shadows"
-Run_The_Shadows@excite.com
-The Navidson Record! The best film you''ll never see!
-Ryan "Run_The_Shadows"
-Run_The_Shadows@excite.com
-The Navidson Record! The best film you''ll never see!
Topic Locked
This topic has been locked by a moderator. New replies are not allowed.
Sign in to reply to this topic.
Advertisement