Sciweavers

1093 search results - page 8 / 219
» Clustering from Constraint Graphs
Sort
View
ENTCS
2006
192views more  ENTCS 2006»
13 years 9 months ago
Model Transformation From VisualOCL to OCL Using Graph Transformation
In this paper we present a model transformation from a visual representation (VisualOCL) of the Object Constraint Language (OCL) to the textual one using graph transformation. Sta...
Karsten Ehrig, Jessica Winkelmann
ESA
2004
Springer
97views Algorithms» more  ESA 2004»
14 years 3 months ago
Radio Network Clustering from Scratch
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
KDD
2009
ACM
182views Data Mining» more  KDD 2009»
14 years 10 months ago
Scalable graph clustering using stochastic flows: applications to community discovery
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
Venu Satuluri, Srinivasan Parthasarathy
MM
2005
ACM
134views Multimedia» more  MM 2005»
14 years 3 months ago
Graph based multi-modality learning
To better understand the content of multimedia, a lot of research efforts have been made on how to learn from multi-modal feature. In this paper, it is studied from a graph point ...
Hanghang Tong, Jingrui He, Mingjing Li, Changshui ...
SOSP
2009
ACM
14 years 6 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...