Sciweavers

165 search results - page 26 / 33
» A New Algorithm for On-line Coloring Bipartite Graphs
Sort
View
SIGIR
2009
ACM
14 years 2 months ago
Entropy-biased models for query representation on the click graph
Query log analysis has received substantial attention in recent years, in which the click graph is an important technique for describing the relationship between queries and URLs....
Hongbo Deng, Irwin King, Michael R. Lyu
SIGIR
2012
ACM
11 years 10 months ago
Fighting against web spam: a novel propagation method based on click-through data
Combating Web spam is one of the greatest challenges for Web search engines. State-of-the-art anti-spam techniques focus mainly on detecting varieties of spam strategies, such as ...
Chao Wei, Yiqun Liu, Min Zhang, Shaoping Ma, Liyun...
JCDL
2010
ACM
151views Education» more  JCDL 2010»
13 years 9 months ago
Domain-specific iterative readability computation
We present a new algorithm to measure domain-specific readability. It iteratively computes the readability of domainspecific resources based on the difficulty of domain-specific c...
Jin Zhao, Min-Yen Kan
ICALP
2009
Springer
14 years 8 months ago
Fast FAST
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
Noga Alon, Daniel Lokshtanov, Saket Saurabh
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 8 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...