Machine Learning, etc

I've accepted an offer from Google and will be joining their Tesseract team next week. I first got interested in OCR when I faced a pr...

Maximum independent set, or "maximum stable" set is one of classical NP-complete problems described in Richard Karp's 1972 pap...

A recent discussion on stackoverflow brought up the issue of results of floating point arithmetic being non-reproducible A reader asked wha...

Today I got Google Alert today on the following pending patent -- Belief Propagation for Generalized Matching . I like to stay up on Belief...

With regular distributive law you can do things like $$\sum_{x_1,x_2,x_3} \exp(x_1 + x_2 + x_3)=\sum_{x_1} \exp x_1 \sum_{x_2} \exp x_2 \sum...

Suppose we want to count the number of independent sets in a graph below. There are 9 independent sets. Because the graphs are disjoint we c...

There's a neat connection between Cholesky factorization and graph triangulations -- graph corresponding to Cholesky factorization of a ...

Here's a 367 vertex Apollonian Network and its Junction Tree (aka Tree Decomposition) A Junction Tree provides an efficient data struct...

Here's a page linking 65 attempts of resolving P vs NP problem. A couple of papers were published in peer-reviewed journals or conferen...

First programmers wrote in machine code and assemblers simplified this task significantly by letting them give algorithms at a higher level....

Here's a tool (in Mathematica) to help visualize the process of constructing a Junction Tree. wrong link fixed Clicking on vertices cor...

Here are some links to start the new year on a light note Hinged tesselation Statistics-related Cartoons on stats.SE Memorable math pap...

Suppose we'd like to visualize a set of joint probabilities realizable by distributions of 3 binary variables. It is a 7 dimensional reg...

One approach to solving hard problems is to break them into computationally efficient parts. For instance, Globerson/Jaakkola do approximat...