903 search results - page 47 / 181 » Non-well-founded trees in categories |
107
click to vote
JCDL
2006
ACM
15 years 8 months ago
2006
ACM
We describe an HTML web page segmentation algorithm, which is applied to segment online medical journal articles (regular HTML and PDF-Converted-HTML files). The web page content ...
114
click to vote
CIKM
2005
Springer
15 years 7 months ago
2005
Springer
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
212
click to vote
POPL
2006
ACM
16 years 2 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
PPOPP
2010
ACM
15 years 11 months ago
2010
ACM
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
144
Voted
IWPSE
2007
IEEE
15 years 8 months ago
2007
IEEE
We present a method to detect and visualize evolution patterns in C++ source code. Our method consists of three steps. First, we extract an annotated syntax tree (AST) from each v...