3267 search results - page 151 / 654 » Generalized quasirandom graphs |
121
click to vote
WWW
2005
ACM
16 years 5 months ago
2005
ACM
This paper shows how a corpus of instant messages can be employed to detect de facto communities of practice automatically. A novel algorithm based on the concept of Edge Stress F...
122
click to vote
SIGCOMM
2009
ACM
15 years 11 months ago
2009
ACM
We describe a new model for studying intermittently connected mobile networks, based on Markovian random temporal graphs, that captures the influence of message size, maximum tol...
128
click to vote
ISCIS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Given a set of observations of an existing concurrent system with repetitive sub-functions, we consider the construction of an MSC graph representing the functionality of...
155
click to vote
WAOA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
137
click to vote
PPAM
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...