Sciweavers

135 search results - page 15 / 27
» Hardness of cut problems in directed graphs
Sort
View
SOFTVIS
2006
ACM
15 years 3 months ago
Semantic web data visualization with graph style sheets
Visual paradigms such as node-link diagrams are well suited to the representation of Semantic Web data encoded with the Resource Description Framework (RDF), whose data model can ...
Emmanuel Pietriga
95
Voted
PAMI
2006
181views more  PAMI 2006»
14 years 9 months ago
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....
Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka
79
Voted
TKDE
2008
121views more  TKDE 2008»
14 years 9 months ago
On Modularity Clustering
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
74
Voted
DATE
2007
IEEE
146views Hardware» more  DATE 2007»
15 years 3 months ago
Data-flow transformations using Taylor expansion diagrams
Abstract: An original technique to transform functional representation of the design into a structural representation in form of a data flow graph (DFG) is described. A canonical,...
Maciej J. Ciesielski, Serkan Askar, Daniel Gomez-P...
ISCAPDCS
2007
14 years 11 months ago
A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
Omar Kermia, Yves Sorel