ggruschow | 2 years ago | on: Cutting a 700 carat rare valuable gemstone [video]
ggruschow's comments
ggruschow | 3 years ago | on: Project Butterly: restoring and preserving the IBM ThinkPad 701
ggruschow | 3 years ago | on: Extracting WhatsApp Messages from an iOS Backup
For perspective.. I remember downloading and installing Linux off floppies. That sucked too, especially with bad disks or download errors, but it was less frustrating than this.
It seems like they don't improve it because iCloud seems like it works smoothly, and they get an on-going profit stream out of it. The process was so brutal I almost broke down and paid for a ton of iCloud storage.. but didn't because getting lots of photos out of iCloud is also painful.
ggruschow | 14 years ago | on: Show HN: HackerThings - Products for hackers
ggruschow | 14 years ago | on: Nasdaq ITCH
- 50mb is >> total cache on most systems you'll use.
- This is far from the only function you need to optimize.
--> The best performing algorithm in a micro-benchmark can be sub-optimal in real use.
- You've got a fixed-for-the-day list of <10k <9 letter unique upper-case strings
- The bulk of them you'll process are <= 4 letters (CMCSA/CMCSK be damned).
- The median is 3 and the mean is <3.6.
- The symbols aren't anywhere close to uniformly active
--> Benchmark with a typical data stream, not a uniformly distributed one.
- You're likely not even considering trading most of them.
- How much better is your algorithm than the obvious binary-search?
- Or worse -- plain'ol front-to-back linear search?
- Are you sure you understand 100% of how the computer works?
--> Yes? Mail a check to Goldman and find a better line of work.
--> No? Test it with a quick benchmark.
- Is binary search cache friendly?
- Why not? Plot out the memory accesses if need be.
- What's wrong with taking a linear-interpolated guess?
- Is that cache friendly? .. or could it be?
- When your guess misses, what's that cost?
- Can you think of a cheap modification to lower that cost?
- Is the distribution really linear?
- What's wrong with a "perfect hash function"?
- Does it need to be perfect?
Incidentally, hardware wins at this function. You can just generate logic to do all the if symbol == "XYZ": return 3's in parallel.ggruschow | 14 years ago | on: People who work from home are more satisfied with their jobs
ggruschow | 14 years ago | on: Building a pure CSS 3D City
ggruschow | 14 years ago | on: Building a pure CSS 3D City
ggruschow | 14 years ago | on: Building a pure CSS 3D City
ggruschow | 15 years ago | on: IPhone 4 About to Be Flickr's Top Camera
ggruschow | 15 years ago | on: Want to make money with Android? Have questions?
ggruschow | 15 years ago | on: Why you should never, ever use two spaces after a period
ggruschow | 15 years ago | on: Algorithms take control of Wall Street
ggruschow | 15 years ago | on: There isn't really much of a tablet market
ggruschow | 15 years ago | on: Free calling in Gmail extended through 2011
ggruschow | 15 years ago | on: Azul's Pauseless Garbage Collector
On the other hand, did you know you can turn off the garbage collector on CPython?
ggruschow | 15 years ago | on: Build a better spell checker, win $10,000
ggruschow | 15 years ago | on: Ask HN: Any high frequency trading hackers
Low-latency trading though costs everyone. Nobody actually needs anything faster than a fill in a blink of an eye. The only people who think they do really need smarter match engines or to stop taking advantage of people
ggruschow | 15 years ago | on: Microsoft furious at $2,000 bounty for open source Kinect drivers
Note: I'm not making any statement about the possible awesomeness or lameness of the system. All I'm saying is the parts aren't expensive.
ggruschow | 15 years ago | on: Microsoft furious at $2,000 bounty for open source Kinect drivers