In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
Abstract. Highly interactive web applications that offer user experience and responsiveness of desktop applications are becoming increasingly popular. They are often composed out ...
The stability, localization and translation rate of mRNAs are regulated by a multitude of RNAbinding proteins (RBPs) that find their targets directly or with the help of guide RNA...
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
George Beskales, Marcus Fontoura, Maxim Gurevich, ...
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
Haoliang Jiang, Haixun Wang, Philip S. Yu, Shuigen...