Sciweavers

646 search results - page 84 / 130
» Generalized connected domination in graphs
Sort
View
HPDC
2010
IEEE
13 years 9 months ago
Towards optimising distributed data streaming graphs using parallel streams
Modern scientific collaborations have opened up the opportunity of solving complex problems that involve multidisciplinary expertise and large-scale computational experiments. The...
Chee Sun Liew, Malcolm P. Atkinson, Jano I. van He...
MM
2010
ACM
151views Multimedia» more  MM 2010»
13 years 9 months ago
Explicit and implicit concept-based video retrieval with bipartite graph propagation model
The major scientific problem for content-based video retrieval is the semantic gap. Generally speaking, there are two appropriate ways to bridge the semantic gap: the first one is...
Lei Bao, Juan Cao, Yongdong Zhang, Jintao Li, Ming...
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
14 years 1 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
TIT
2010
107views Education» more  TIT 2010»
13 years 3 months ago
Information inequalities for joint distributions, with interpretations and applications
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
Mokshay M. Madiman, Prasad Tetali
KDD
2009
ACM
216views Data Mining» more  KDD 2009»
14 years 9 months ago
Finding a team of experts in social networks
Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...
Theodoros Lappas, Kun Liu, Evimaria Terzi