Sciweavers

895 search results - page 88 / 179
» Using graphs for some discrete tomography problems
Sort
View
CORR
2011
Springer
139views Education» more  CORR 2011»
14 years 1 months ago
Clustering Partially Observed Graphs via Convex Optimization
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
Ali Jalali, Yudong Chen, Sujay Sanghavi, Huan Xu
SIGSOFT
2008
ACM
15 years 10 months ago
Experience in using a process language to define scientific workflow and generate dataset provenance
This paper describes our experiences in exploring the applicability of software engineering approaches to scientific data management problems. Specifically, this paper describes h...
Leon J. Osterweil, Lori A. Clarke, Aaron M. Elliso...
IEEECIT
2009
IEEE
15 years 4 months ago
Clustering of Software Systems Using New Hybrid Algorithms
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
Ali Safari Mamaghani, Mohammad Reza Meybodi
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
15 years 10 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
ICCS
1999
Springer
15 years 2 months ago
Conceptual Structures Represented by Conceptual Graphs and Formal Concept Analysis
Conceptual Graphs and Formal Concept Analysis have in common basic concerns: the focus on conceptual structures, the use of diagrams for supporting communication, the orientation b...
Guy W. Mineau, Gerd Stumme, Rudolf Wille