PaddlePaddle - PArallel Distributed Deep LEarning
Category:
PaddlePaddle - PArallel Distributed Deep LEarning
PaddlePaddle (PArallel Distributed Deep LEarning) is an easy-to-use, efficient, flexible and scalable deep learning platform, which is originally developed by Baidu scientists and engineers for the purpose of applying deep learning to many products at Baidu.

EYE and OWL 2
Category:
EYE and OWL 2
EYE is an inference engine supporting logic based proofs. It is a backward-forward-backward chaining reasoner enhanced with Euler path detection.
The backward-forward-backward chaining is realized via an underlying Prolog backward chaining, a forward meta-level reasoning and a backward proof construction.

Visualizing Algorithms
Category:
Visualizing Algorithms
Algorithms are a fascinating use case for visualization. To visualize an algorithm, we don’t merely fit data to a chart; there is no primary dataset. Instead there are logical rules that describe behavior. This may be why algorithm visualizations are so unusual, as designers experiment with novel forms to better communicate. This is reason enough to study them.

easy*.js
Category:
easy*.js
easystar.js is an asynchronous A* pathfinding API written in Javascript for use in your HTML5 games. The aim of the project is to make it easy and fast to implement performance conscious pathfinding into your project.

Levenshtein Distance and the Triangle Inequality
Category:
Levenshtein Distance and the Triangle Inequality « Inviting Epiphany
The first and most important thing about Levenshtein distance is it’s actually a metric distance. That is, it obeys the triangle inequality. For most other string distance measurements this property doesn’t hold.

LEGO Turing Machine
Category:
LEGO Turing Machine
To honor Alan Turing, we built a simple LEGO Turing Machine, to show everyone how simple a computer actually is. Primary goals were to make every operation as visible as possible and to make it using the automatic components of just a single LEGO MINDSTORMS NXT set, to make it easy to reproduce for those interested.

Restoration of defocused and blurred images.
Category:
Restoration of defocused and blurred images. Yuzhikov.com
Why is there almost no means for correction of blurring and defocusing (except unsharp mask) - maybe it is impossible to do this at all? In fact, it is possible - development of a respective mathematical theory started approximately 70 years ago, but like other algorithms of image processing, deblurring algorithms became wide-used just recently.

AgreementMaker
Category:
AgreementMaker | Efficient Matching for Large Real-World Schemas and Ontologies
AgreementMaker aims at being a user friendly, powerful, and flexible ontology and schema matching system.
Laurence Tratt: Parsing: The Solved Problem That Isn't
Category:
Laurence Tratt: Parsing: The Solved Problem That Isn't
After the creation of programming languages themselves, parsing was one of the first major areas tackled by theoretical computer science and, in many peoples eyes, one of its greatest successes. The 1960s saw a concerted effort to uncover good theories and algorithms for parsing. Parsing in the early days seems to have shot off in many directions before, largely, converging. Context Free Grammars (CFGs) eventually "won", because they are fairly expressive and easy to reason about, both for practitioners and theorists.

Smoothing with Holt-Winter
Category:
Smoothing with Holt-Winter - PHP/ir
In one of his talks at QCon, John Allspaw mentioned using Holt-Winter exponential smoothing on various monitoring instances. Wikipedia has a good entry on the subject, of course, but the basic idea is to take a noisy/spikey time series and smooth it out, so that unexpected changes will stand out even more. That's often initially done by taking a moving average, so say averaging the last 7 days of data and using that as the current day's value. More complicated schemes weight that average, so that the older data contributes less.