Sciweavers

128 search results - page 11 / 26
» Comparing top k lists
Sort
View
EDBT
2009
ACM
108views Database» more  EDBT 2009»
14 years 19 hour ago
Reverse k-nearest neighbor search in dynamic and general metric databases
In this paper, we propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem. Compared to the limitations of existing methods for the RkNN searc...
Elke Achtert, Hans-Peter Kriegel, Peer Kröger...
IPPS
2010
IEEE
13 years 4 months ago
Designing high-performance and resilient message passing on InfiniBand
Abstract--Clusters featuring the InfiniBand interconnect are continuing to scale. As an example, the "Ranger" system at the Texas Advanced Computing Center (TACC) include...
Matthew J. Koop, Pavel Shamis, Ishai Rabinovitz, D...
TKDE
2008
191views more  TKDE 2008»
13 years 7 months ago
Beyond Single-Page Web Search Results
Given a user keyword query, current Web search engines return a list of individual Web pages ranked by their "goodness" with respect to the query. Thus, the basic unit fo...
Ramakrishna Varadarajan, Vagelis Hristidis, Tao Li
COLING
2010
13 years 2 months ago
Build Chinese Emotion Lexicons Using A Graph-based Algorithm and Multiple Resources
For sentiment analysis, lexicons play an important role in many related tasks. In this paper, aiming to build Chinese emotion lexicons for public use, we adopted a graph-based alg...
Ge Xu, Xinfan Meng, Houfeng Wang
CIKM
2001
Springer
13 years 12 months ago
Approaches to Collection Selection and Results Merging for Distributed Information Retrieval
We have investigated two major issues in Distributed Information Retrieval (DIR), namely: collection selection and search results merging. While most published works on these two ...
Yves Rasolofo, Faiza Abbaci, Jacques Savoy