193 search results - page 27 / 39 » Members of Random Closed Sets |
96
Voted
ACMSE
2006
ACM
15 years 6 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...
99
Voted
CP
1997
Springer
15 years 4 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...
NSDI
2004
15 years 2 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...
110
Voted
JCT
2007
15 years 17 days 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.,...
102
Voted
INFOCOM
2010
IEEE
14 years 11 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...