We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
We introduce the problem of domain adaptation for content-based retrieval and propose a domain adaptation method based on relative aggregation points (RAPs). Content-based retriev...
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir
Large writes are beneficial both on individual disks and on disk arrays, e.g., RAID-5. The presented design enables large writes of internal B-tree nodes and leaves. It supports b...
s In TREC-10, we participated in the web track (only ad-hoc task) and the QA track (only main task). In the QA track, our QA system (SiteQ) has general architecture with three proc...
Gary Geunbae Lee, Jungyun Seo, Seungwoo Lee, Hanmi...