jwp

8 ms·

1.
by jwp 13y ago
It also resonates especially when you're reading from hard experience. A year ago I would have quickly read & enjoyed this, then moved on. Now too many items give me pause as I recall some mistake I've made. It is very good
2.
by jwp 14y ago
This is exactly the same handshake deal the founders of Fairchild Semiconductor did with each other.
3.
by jwp 14y ago
What he said! I'd like to add that a key to squeezing more out of NathanRice's post is the phrase "conjugate prior." Another totally natural thing would be to use a Gaussian prior & likelihood, then update the posterior as ratings arr
4.
by jwp 18y ago
Hey, AOLserver is open source. At the time it was the only web server with a built-in glue language (Tcl) and pooled database connections. It got me excited about web programming. Plus, the sheer amount of code already written was fantas
5.
by jwp 18y ago
Kevin Garnett plays exactly the same way that you describe Jack Lambert. He goes only one speed: full blast. Whenever I need motiviation, I find myself asking myself, wwkgd?
6.
by jwp 18y ago
Creating the list of URLs and prioritizing them is the hardest thing about building a crawler! That is, a good, web-scale one. A replacement for wget might be sort of fun, but the real way to make a fast crawler is to be choosy about whic
7.
by jwp 19y ago
Sure, there's plenty of fluff in the article, but it isn't because the author ( http://www.math.wisc.edu/~ellenber/ ) is clueless about science. The article is probably at the right level of technical depth. Seems ambitious to even touch
8.
by jwp 19y ago
Suffix array.
9.
by jwp 19y ago
I remember seeing this video in a very sobering HBO documentary: http://www.hbo.com/docs/programs/hackingdemocracy/
10.
by jwp 19y ago
Nespresso is great. At $0.50 per pod, it's pricey, but for such painless cleanup and consistently good shots, worth the price. Hands down the best teas I've had come from Upton Tea (uptontea.com).
11.
by jwp 19y ago
My intuition says it's not possible to get 1 without destroying the ability to get 2, or vice versa. But I'm no expert. The solution that leaps to my mind is to use a locality-sensitive hash function. It would make search stochastic, whi
12.
by jwp 19y ago
That's not true. You can submit your results and then refuse to release your algorithm, disqualifying you from the competition. "Upon qualifying, as described above, the Participant is required to submit within one (1) week for judging a
13.
by jwp 19y ago
What's your score on the Netflix Prize quiz?
14.
by jwp 19y ago
We prefer to call it a family.
15.
by jwp 19y ago
The non-friend vs anti-friend distinction didn't even occur to me, but it's clearly an important part of the experiment. I like all the discussion of data. Fun problem. I did not realize squaring an adj matrix tells you what it does. Th
16.
by jwp 19y ago
Yeah, yeah, so the engineering part wasn't that great. But were the results good? Which algorithms did you use? What were your features? Seems like an interesting experiment, especially with all the gratuitous "friending" people do. R
17.
by jwp 19y ago
Good cites. I second them. Mackay and Jaynes are excellent but can get out of hand quickly. Duda, Hart and Stork is another good hardcore option. When I need the book "for dummies," which is pretty often, the Weka book and Mitchell's Ma
18.
by jwp 19y ago
A very important question... Celestial Seasonings Fast Lane tea.
19.
by jwp 19y ago
The MSFT guy is right. Full open speech recognition is very hard and a long way away. For some simpler tasks, it's fine. On a related note, I was surprised to discover that "say" works over remote logins. Try "ssh some-mac say hello worl
20.
by jwp 19y ago
When you file yourself (pro se), the PTO is gentler and kinder than they are if a lawyer files for you. If you have the time and energy, file now to get the early filing date and call a lawyer later.
21.
by jwp 19y ago
This begs the question, how do you define a bot? From my understanding of the talk, they replay one person's session and don't use composites. But, point taken.
22.
by jwp 19y ago
It depends on what your definition of "bot" is. Are you talking about when the ESP game records a person's session, then plays those moves back to other players (and other recorded sessions)? If enough about the recorded play is logged, w
23.
by jwp 20y ago
From what I can tell a lot of this CF stuff starts with a machine learning algorithm and data about likes/dislikes, making filtering a classification or search task. Is there something that differentiates it from the usual machine learning
24.
F-22 stealth's computers crash at the int'l date line(defensetech.org)
2 points by jwp 20y ago|1 comments
25.
Job satisfaction level hits new low, especially among younger workers(msnbc.msn.com)
3 points by jwp 20y ago|3 comments
26.
by jwp 20y ago
Hmm, perhaps we should talk. Email me at e40.32313371@bloglines.com if you're interested.
27.
by jwp 20y ago
The first link you cited is spot on. The authors are from Univ of Cambridge, and work on HTK <http://htk.eng.cam.ac.uk/>. That paper is 10 years old. As I'm sure you can imagine, there have been improvements in the field sin
28.
by jwp 20y ago
I work on speech recognition. What Blinkx is doing isn't novel. (Sorry, Blinkx.) Google has top speech researchers working on search for speech and video. Same for MSFT. Remember the Kai-Fu Lee thing? The guy who built CMU Sphinx,
29.
by jwp 20y ago
IANAL either (although I do date one), and I too have heard of these things. I think they are called E-2 visas. They require you to raise or invest around $100k in a US business. The lawyer who told me about the E-2 was quick to warn tha
30.
by jwp 20y ago
I'm glad you linked to the talk. It's excellent. I'm curious, why do you think that visual games are more likely to be successful? His question answering games seemed useful and engaging, too. There must be great startup i

More ›