Sciweavers

6833 search results - page 1366 / 1367
» Some two-character sets
Sort
View
KDD
2012
ACM
202views Data Mining» more  KDD 2012»
11 years 8 months ago
UFIMT: an uncertain frequent itemset mining toolbox
In recent years, mining frequent itemsets over uncertain data has attracted much attention in the data mining community. Unlike the corresponding problem in deterministic data, th...
Yongxin Tong, Lei Chen 0002, Philip S. Yu
SIGIR
2012
ACM
11 years 8 months ago
Predicting quality flaws in user-generated content: the case of wikipedia
The detection and improvement of low-quality information is a key concern in Web applications that are based on user-generated content; a popular example is the online encyclopedi...
Maik Anderka, Benno Stein, Nedim Lipka
WWW
2005
ACM
14 years 7 months ago
CubeSVD: a novel approach to personalized Web search
As the competition of Web search market increases, there is a high demand for personalized Web search to conduct retrieval incorporating Web users' information needs. This pa...
Jian-Tao Sun, Hua-Jun Zeng, Huan Liu, Yuchang Lu, ...
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 6 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
14 years 6 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
« Prev « First page 1366 / 1367 Last » Next »