String Similarity Metrics for Information Integration
Web Intelligence, Natural Language Processing Group, Department of Computer Science, University of Sheffield, Regent Court, 211 Portobello Street, Sheffield, S1 4DP, UNITED KINGDOM Tel:+44(0)114-2228000 Fax:+44(0)114-22.21810 sam@dcs.shef.ac.uk Reverend Sam Chapman's HomePage details his work at the Department of Computer Science Regent Court 211 Portobello Street Sheffield S1 4DP
Pattern Matching Pointers (maintained by Stefano Lonardi)
Combinatorial Pattern Matching addresses issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties for such structures and then to exploit these properties in order to achieve improved performance for the corresponding computational problem. A steady flow of h
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
ESMAJ
