Sciweavers

1883 search results - page 129 / 377
» Ordered theta graphs
Sort
View
PROCEDIA
2010
344views more  PROCEDIA 2010»
13 years 6 months ago
Towards high-quality, untangled meshes via a force-directed graph embedding approach
High quality meshes are crucial for the solution of partial differential equations (PDEs) via the finite element method (or other PDE solvers). The accuracy of the PDE solution,...
Sanjukta Bhowmick, Suzanne M. Shontz
TAOSD
2010
13 years 6 months ago
A Graph-Based Aspect Interference Detection Approach for UML-Based Aspect-Oriented Models
Abstract. Aspect Oriented Modeling (AOM) techniques facilitate separate modeling of concerns and allow for a more flexible composition of these than traditional modeling technique...
Selim Ciraci, Wilke Havinga, Mehmet Aksit, Christo...
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 8 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...
SIAMDM
2010
170views more  SIAMDM 2010»
13 years 2 months ago
Complete Minors and Independence Number
Let G be a graph with n vertices and independence number . Hadwiger's conjecture implies that G contains a clique minor of order at least n/. In 1982, Duchet and Meyniel prov...
Jacob Fox
CVPR
2009
IEEE
15 years 3 months ago
Efficient Planar Graph Cuts with Applications in Computer Vision
We present a fast graph cut algorithm for planar graphs. It is based on the graph theoretical work [2] and leads to an efficient method that we apply on shape matching and im- a...
Daniel Cremers, Eno Töppe, Frank R. Schmidt