137 karma · joined January 9, 2011
While my research was a little blue sky (what isn't) I do think that electronic trading of computation resources is the future, and I think Amazon are ahead of the game in this respect.
The issue is getting people to start using such a service.
If so, what's to stop the user doing the equivalent of “menu button and power button” on the iPhone, to take a screen shot?
1) lowercase inputted password. 2) hash password 3) compare hash to db hash (which was from a lowercased initial password).
- specify result rankings;
- add facets to our products and then SS allows the customer to do things like compare products, restrict to over $$, or only white, grey and red;
- does fuzzy completions etc.
I ask because while the product we use is OK, it doesn't have a great API, and I want to be able to integrate more tightly with the service and allow myself to do things like A/B tests, dynamic results, customer specific rankings etc.
Here's a question - is it possible to ever do something like this without the requirement of finding 300K via consulting gigs first? I assume that given there were 3 of them and they spent only a few months building it, they didn't need all of the 300K on salaries.
I suppose you would have to grow the product from a smaller stage, rather than build it and launch?
Personally, I can't stand writing/reading code displayed in a proportional font.
print reduce(lambda x, y: x*y, xrange(2, 6+1))
As a newish Python guy (5 months), I'm interested as to why the preferable solution seems to be to import operator and use the multiplication function? (I'm purposely ignoring the more preferable call to the C library)I replaced it with an OWC Mercury Electra 120GB; had to return that one off-the-bat, as it was DOA! Not having much luck, but I'm hoping my OWC replacement will be OK. . .
Even if Google take more value from people than any other company, they can still provide a portion of that value to n other people, and assuming n is larger than any other company's n, Patrick's point still holds.
</pedant>
After the 6th time of it corrupting various parts of my filesystem (often the catalogue and other important parts), I'm returning it to Amazon.
It was twice as annoying because I had to re-rip open my iMac to get at it. I think I will be exchanging it for an OWC Mercury Extreme.
I certainly feel there is a correlation between _tolerance_ and performance.
In the list specifying the rewards for investment on the Kickstarter page, the author specifies investors receive free copies of the iOS game. I was under the impression that Apple didn't allow developers to sell copies of games outside of the app store?
I've used both approaches for a different application and neither dominate the other.
Further, there are some other challenging aspects to this. 1) The environment -- visitors' preferences over time, your competitors' pages -- is very dynamic; 2) because you have to test and learn in the real world, your actions may impact your future performance.
I used and designed these types of algorithms for my PhD research, but applied them to trader selection between market exchanges; my thesis is in my sig if anyone is interested.
I guess they're working on the revenue generating bit, as seems to be the case for so many funded tech companies over the last few years.
In terms of mag-safe on iOS devices, I guess it's not feasible due to it transmitting data.
> To be clear, interpolation search can cut down the runtime by another log factor (`O(log log n)` instead of `O(log n)`) but it's just not worth the effort, especially in this case, precisely because the lines aren't uniformly distributed.
It doesn't matter what the distribution is as long as you can learn it. Uniform helps when you are cutting down the search space in regular chunks, sure. The Reddit data wont be uniform - so don't cut the search space uniformly.
As I said, something faster could be conceived if one studies the average number of visitors over a 24 hour period (I don't know where this data could be gathered from).
If you can make your first seek very accurate, then it may be the case that simple linear search from there will get you there faster than Binary Search.
You can still report average and worst-case complexities under the assumption you have taken about how the log data is distributed.
Sorry to keep going on about this, but I just wanted to make my point clear! Good discussion.
I assumed Reddit would want something a bit more special that the hundreds of Binary Search implementations they are going to receive. There are always faster algorithms that can be designed for specific problems, even if realistically they only save (in this case) 100ms.
It's a competition - you're supposed to stand out.
Reddit will most likely have regular busy and quiet periods, which will impact the density of the log at certain times.
Thus, one can tune the algorithm to work better on Reddit's specific visitor pattern, if you can learn it. As an example, you need to jump back further in the file to get from 8pm to 6pm than you do to jump back from 4am to 2am. <- assuming US time, which they don't.