193 search results - page 27 / 39 » Members of Random Closed Sets |
126
Voted
ACMSE
2006
ACM
15 years 9 months ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
118
Voted
CP
1997
Springer
15 years 7 months ago
1997
Springer
Abstract. Combinatorial search methods often exhibit a large variability in performance. We study the cost pro les of combinatorial search procedures. Our study reveals some intrig...
118
click to vote
NSDI
2004
15 years 4 months ago
2004
This paper explores the model of providing a common overlay structure management layer to assist the construction of large-scale wide-area Internet services. To this end, we propo...
130
click to vote
JCT
2007
15 years 3 months ago
2007
Abstract. Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e.,...
129
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract—We provide a formal model for the Change Management process for Enterprise IT systems, and develop change scheduling algorithms that seek to attain the “change capacit...