Sciweavers

2270 search results - page 444 / 454
» On the distribution of eigenvalues of graphs
Sort
View
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
14 years 1 months ago
Parallel community detection on large networks with propinquity dynamics
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
Yuzhou Zhang, Jianyong Wang, Yi Wang, Lizhu Zhou
REFLECTION
2001
Springer
14 years 1 months ago
Performance and Integrity in the OpenORB Reflective Middleware
, are to address what we perceive as the most pressing shortcomings of current reflective middleware platforms. First, performance: in the worst case, this needs to be on a par wit...
Gordon S. Blair, Geoff Coulson, Michael Clarke, Ni...
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
14 years 28 days ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
COCO
2010
Springer
135views Algorithms» more  COCO 2010»
14 years 15 days ago
Lower Bounds for Testing Function Isomorphism
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
Eric Blais, Ryan O'Donnell
ICLP
2010
Springer
14 years 15 days ago
Models for Trustworthy Service and Process Oriented Systems
Abstract. Service and process-oriented systems promise to provide more effective business and work processes and more flexible and adaptable enterprise IT systems. However, the t...
Hugo A. López