We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...
We present in this paper ObjectRunner, a system for extracting, integrating and querying structured data from the Web. Our system harvests real-world items from template-based HTM...
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching through the label structure of the XM...
IEDB-3D is the 3D structural component of the Immune Epitope Database (IEDB) available via the ‘Browse by 3D Structure’ page at http://www.iedb .org. IEDB-3D catalogs B- and T...
Julia V. Ponomarenko, Nikitas Papangelopoulos, Dir...