Sciweavers

2911 search results - page 264 / 583
» A Logic of Graph Constraints
Sort
View
ICIP
2005
IEEE
16 years 8 months ago
Graph cuts segmentation using an elliptical shape prior
We present a graph cuts-based image segmentation technique that incorporates an elliptical shape prior. Inclusion of this shape constraint restricts the solution space of the segm...
Gregory G. Slabaugh, Gozde B. Unal
AGTIVE
2003
Springer
15 years 12 months ago
On Graphs in Conceptual Engineering Design
Abstract. This paper deals with knowledge-based computer aided design. A novel method giving additional support for conceptual design is presented. In this method, a designer firs...
Janusz Szuba, Agnieszka Ozimek, Andy Schürr
COCOON
2006
Springer
15 years 10 months ago
A Detachment Algorithm for Inferring a Graph from Path Frequency
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
Hiroshi Nagamochi
DIALM
2005
ACM
104views Algorithms» more  DIALM 2005»
15 years 8 months ago
Information dissemination in highly dynamic graphs
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Regina O'Dell, Roger Wattenhofer
UAI
2008
15 years 8 months ago
Clique Matrices for Statistical Graph Decomposition and Parameterising Restricted Positive Definite Matrices
We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to d...
David Barber