cedar - C++ implementation of efficiently-updatable double-array trie About Cedar implements an updatable double-array trie [1,2,3], which offers fast update/lookup for skewed queries in real-world data, e.g., counting words in text or mining conjunctive features in a classifier. Its update and lookup speed is comparable to (hard-to-serialize) hash-based containers (std::unordered_map) or modern c
The Felix Programming Language High performance scripting language. Tutorials | Language Reference | Library Reference | User Guide | Download | Community Run source programs directly. Generates machine binaries via C++ instead of bytecode. Statically typed for reliability and scalability. Supports both ML-like functional and C-like imperative programming styles. Rich set of datatypes in standard
Overview What forms of isolation does it provide Which use-cases are supported Isolation of network services (inetd style) Isolation with access to a private, cloned interface (requires root/setuid) Isolation of local processes Isolation of local processes (and re-running them, if necessary) Examples of use Bash in a minimal file-system with uid==0 and access to /dev/urandom only /usr/bin/find in
Algorithms that are the main driver behind a system are, in my opinion, easier to find in non-algorithms courses for the same reason theorems with immediate applications are easier to find in applied mathematics rather than pure mathematics courses. It is rare for a practical problem to have the exact structure of the abstract problem in a lecture. To be argumentative, I see no reason why fashiona
Fastest strstr-like Function!? I've made a blend of the famous Karp-Rabin-Boyer-Moore-Horspool-Sunday algorithms named Railgun. When a needle is needed to be found in a haystack here comes the Railgun_Quadruplet - an extremely fast pattern searcher designed both for short(2bytes) and long(gigabytes) patterns/strings, to be replaced by Railgun_r8_Mimino_x64 hopefully this year. Until then the FASTE
最小カットを使って「燃やす埋める問題」を解く方法について、問題とソースコードつきで、まとめました。ニコニコ生放送「TopCoderでプログラムしてみた」2000回記念放送の資料です。
Spelling correction & Fuzzy search: 1 million times faster through Symmetric Delete spelling correction algorithm The Symmetric Delete spelling correction algorithm reduces the complexity of edit candidate generation and dictionary lookup for a given Damerau-Levenshtein distance. It is six orders of magnitude faster (than the standard approach with deletes + transposes + replaces + inserts) and la
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く