Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
Pattern discovery in DNA sequences is one of the most challenging tasks in molecular biology and computer science. The main goal of pattern discovery in DNA sequences is to identi...
Yi Lu, Shiyong Lu, Farshad Fotouhi, Yan Sun, Zijia...
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
We examine clarification dialogue, a mechanism for refining user questions with follow-up questions, in the context of open domain Question Answering systems. We develop an algori...