Search Results

In order to resize an image properly (particularly, to reduce the size of an image), you need an interpolation filter scaled to the smaller of the source and destination sizes. Unfortunately, if your …

The short version: absent unusual circumstances, you should use a single-threaded traversal. As @CodesInChaos says, your computer is likely to be I/O bound in both phases of your task: size-checkin …

If you have multiple queries, you can use a spatial datastructure to accelerate them. This typically requires preprocessing your target points, and in any case will cost you some time and space. The …

The simplex method for linear programming can be exponential in the worst case, while relatively new interior point algorithms can be polynomial. … (There are now more modern interior point algorithms which are competitive -- but the simplex method is, too...) …

You can hash your sub-trees: for each node, generate a hash value based on the values of interest (i.e., excluding leaf values) and the hash values of its children, in order. Use this hash to insert …

You probably want a disjoint set datastructure. This yields near-constant amortized performance per operation, and can be made very efficient for the kind of task you describe. Briefly, each equival …

If you use vector algebra (which is easy with a vector algebra library), there is no real difference between the 3-d case and the N-d case. Unfortunately, the page you link to has written out the vec …

The actual performance of algorithms depends on the platform, as well as the language, the compiler, programmer attention to implementation detail, specific optimization effort, et cetera. … Over time, as the dominant platform changes, different algorithms may gain or lose their (ill-defined) relative advantage. …

The nice thing about the PageRank algorithm is that it can be solved iteratively in a distributed way, within the MapReduce framework. However, the working data for Pagerank on ~5M nodes and ~50M edg …

If your assignment doesn't specify how to discriminate between identical frequencies, then the compression format is underspecified, and you generally can't expect independent implementations to inter …

If your scene is static (i.e., your triangles don't move, so you can amortize building your acceleration datastructure across all your lines), then I believe that a highly optimized kd-tree is still s …

Lempel-Ziv style compression does the kind of thing you're looking for. For your application, it sounds like you want a fixed "string dictionary" (LZ's internal representation of your token definitio …

If you want to lump together neighbors with equal values, you can use a disjoint-set (aka union-find) datastructure to efficiently categorize sets of equivalent neighbors. However, if your matrix val …