Titlebook: String Processing and Information Retrieval; 9th International Sy Alberto H. F. Laender,Arlindo L. Oliveira Conference proceedings 2002 Spr

Suppository

2否定

Stemming Galician TextsGalician. The algorithm has already been implemented, and we have started to use it for its improvement. But this stemming algorithm cannot be applied over documents previous to the appearance of the first Galician orthographic regulation in 1977; therefore we have adopted an ., consisting in defini

decipher

步履蹒跚

Anticoagulants

Web Structure, Dynamics and Page Qualityudied using different link-based metrics considering their relationship with the structure of the Web and the last modification time of a page. We show that, as expected, Pagerank is biased against new pages. As a subproduct we propose a Pagerank variant that includes page recency into account and w

Obloquy

A Theoretical Analysis of Google’s PageRank a modification of this formula on a mathematical basis. Following the thread of this argument we get to a well-founded general formula, that covers many interesting different cases, and among them that of PageRank, the algorithm used by the Google search engine, as it is currently proposed in recen

outer-ear

Lucubrate

Tree Pattern Matching for Linear Static Termsign of programming languages, theorem proving and symbolic computation for example. Our algorithm relies on the representation of a tree by words. It has a quadratic worst-case time complexity, which is worse than the best known algorithm, but experimental results on uniformly distributed random bin

昏迷状态

数量

Pattern Matching over Multi-attribute Data Streamslgorithms that generalize string-matching algorithms for detecting patterns with complex predicates over data streams having multiple categorical and quantitative attributes. Implementation and evaluation of the algorithms show their efficiency when compared to the naive approach.