Sciweavers

356 search results - page 71 / 72
» A Most General Edge Elimination Polynomial - Thickening of E...
Sort
View
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 1 months ago
Multi-skill Collaborative Teams based on Densest Subgraphs
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
Amita Gajewar, Atish Das Sarma
CASON
2010
IEEE
12 years 10 months ago
Social Network Reduction Based on Stability
—The analysis of social networks is concentrated especially on uncovering hidden relations and properties of network members (vertices). Most of the current approaches are focuse...
Milos Kudelka, Zdenek Horak, Václav Sn&aacu...
EMSOFT
2011
Springer
12 years 6 months ago
Hard-real-time scheduling of data-dependent tasks in embedded streaming applications
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
Mohamed Bamakhrama, Todor Stefanov
KDD
2012
ACM
229views Data Mining» more  KDD 2012»
11 years 8 months ago
Finding trendsetters in information networks
Influential people have an important role in the process of information diffusion. However, there are several ways to be influential, for example, to be the most popular or the...
Diego Sáez-Trumper, Giovanni Comarela, Virg...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
13 years 11 months ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li