Sciweavers

486 search results - page 75 / 98
» Boosting and Hard-Core Sets
Sort
View
94
Voted
WWW
2008
ACM
16 years 1 months ago
Ranking refinement and its application to information retrieval
We consider the problem of ranking refinement, i.e., to improve the accuracy of an existing ranking function with a small set of labeled instances. We are, particularly, intereste...
Rong Jin, Hamed Valizadegan, Hang Li
90
Voted
WWW
2006
ACM
16 years 1 months ago
Mining clickthrough data for collaborative web search
This paper is to investigate the group behavior patterns of search activities based on Web search history data, i.e., clickthrough data, to boost search performance. We propose a ...
Jian-Tao Sun, Xuanhui Wang, Dou Shen, Hua-Jun Zeng...
89
Voted
OSDI
2004
ACM
16 years 25 days ago
FFPF: Fairly Fast Packet Filters
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
Herbert Bos, Willem de Bruijn, Mihai-Lucian Criste...
206
Voted
SIGMOD
2009
ACM
191views Database» more  SIGMOD 2009»
16 years 23 days ago
Scalable skyline computation using object-based space partitioning
The skyline operator returns from a set of multi-dimensional objects a subset of superior objects that are not dominated by others. This operation is considered very important in ...
Shiming Zhang, Nikos Mamoulis, David W. Cheung
99
Voted
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
16 years 9 days ago
Similarity Search on Supergraph Containment
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
Haichuan Shang, Ke Zhu, Xuemin Lin, Ying Zhang, Ry...