Cache-oblivious algorithm - Wikipedia
In computing, a cache-oblivious algorithm (or cache-transcendent algorithm) is an algorithm designed to take advantage of a processor cache without having the size of the cache (or the length of the cache lines, etc.) as an explicit parameter. An optimal cache-oblivious algorithm is a cache-oblivious algorithm that uses the cache optimally (in an asymptotic sense, ignoring constant factors). Thus,
Locality of reference - Wikipedia
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Locality of reference" – news · newspapers · books · scholar · JSTOR (July 2008) (Learn how and when to remove this message) In computer science, locality of reference, also known as the principle of loc
Mamoru KOMACHI aka mamoru-k @ matsu-lab
Hanabi-bu (Fireworks club) leader (2005.5-2006.6) NAIST Open Source Club leader (2005.7-2007.3) Summer internship @ NTT Cyber Space Laboratories, Kanagawa, Japan (2005.8-2005.9) User-Oriented Package Management System, Mito (Exploratory Software) Youth Project, Information-Technology Promotion Agency, Japan (2005.7-2006.3) Open Source Software Developers Connection Project, NAIST Schalarship, Japa
A Neighborhood of Infinity: Beyond Regular Expressions: More Incremental String Matching
In my last post I showed how to incrementally match long strings against regular expressions. I now want to apply similar methods to matching languages that can't be described by regular expressions. (Note that 'language' is just jargon for a set of strings that meet some criterion.) In particular, regular expressions can't be used to test a string for balanced parentheses. This is because we need
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
{{#tags}}- {{label}}
{{/tags}}