Memory Implementations - Current Alternatives

Memory Implementations - Current Alternatives

In an attempt to ensure good-quality printouts of our technical reports, from the supplied PDF files, we process to PDF using Acrobat Distiller. We encourage our authors to use outline fonts coupled with embedding of the used subset of all fonts (in either Truetype or Type 1 formats) except for the standard Acrobat typeface families of Times, Helvetica (Arial), Courier and Symbol. In the case o...

Alternatives in FPGA-based SAD implementations

In multimedia processing, it is well-known that the sumof-absolute-differences (SAD) operation is the most time-consuming operation when implemented in software running on programmable processor cores. This is mainly due to the sequential characteristic of such an implementation. In this paper, we investigate several hardware implementations of the SAD operation and map the most promising one i...

Arabic Computational Linguistics: Current Implementations

Hysterectomy: Current Methods and Alternatives

Hysterectomies performed in the field of obstetrics and gynaecology until the 19th century always had a lethal end. In the 20th century they were performed quite successful concerning survival but perhaps too frequently, whereas the 21st century has witnessed a steep decline in hysterectomy numbers. It is, therefore, an opportune time to review the indications for hysterectomies and hysterectom...

Improved external memory BFS implementations ∗

Breadth first search (BFS) traversal on massive graphs in external memory was considered non-viable until recently, because of the large number of I/Os it incurs. Ajwani et al. [3] showed that the randomized variant of the o(n) I/O algorithm of Mehlhorn and Meyer [24] (MM BFS) can compute the BFS level decomposition for large graphs (around a billion edges) in a few hours for small diameter gra...