Sciweavers

128 search results - page 5 / 26
» Comparing top k lists
Sort
View
EUNIS
2001
13 years 8 months ago
High Performance Computing in Europe and USA: A Comparison
Since 1993 we compile and publish twice a year a list of the mostpowerful supercomputers in the world. In this article we compare the situation of High-Performance Computing (HPC)...
Erich Strohmaier, Hans Werner Meuer
SIGMOD
2001
ACM
213views Database» more  SIGMOD 2001»
14 years 7 months ago
Bit-Sliced Index Arithmetic
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
Denis Rinfret, Patrick E. O'Neil, Elizabeth J. O'N...
WSDM
2009
ACM
104views Data Mining» more  WSDM 2009»
14 years 2 months ago
Top-k aggregation using intersections of ranked inputs
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vas...
PVLDB
2010
151views more  PVLDB 2010»
13 years 5 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
Kathy Macropol, Ambuj K. Singh
IRI
2008
IEEE
14 years 1 months ago
Biological question answering with syntactic and semantic feature matching and an improved mean reciprocal ranking measurement
Specific information on biomolecular events such as protein-protein and gene-protein interactions is essential for molecular biology researchers. However, the results derived by c...
Ryan T. K. Lin, Justin Liang-Te Chiu, Hong-Jie Dai...