Generating adequate recommendations for newcomers is a hard problem for a recommender system (RS) due to lack of detailed user profiles and social preference data. Empirical evide...
Patricia Victor, Chris Cornelis, Ankur Teredesai, ...
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
—Utilizing the skewed popularity distribution in P2P systems, common in Gnutella and KazaA like P2P applications, we propose an optimal resource (replica or link) placement strat...
Weixiong Rao, Lei Chen 0002, Ada Wai-Chee Fu, Guor...
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...