Sciweavers

2911 search results - page 201 / 583
» A Logic of Graph Constraints
Sort
View
DIAGRAMS
2008
Springer
15 years 8 months ago
Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages
Abstract. The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is ...
Aidan Delaney, John Taylor, Simon J. Thompson
JDM
2000
82views more  JDM 2000»
15 years 6 months ago
Binary Equivalents of Ternary Relationships in Entity-Relationship Modeling: A Logical Decomposition Approach
Little work has been completed which addresses the logical composition and use of ternary relationships in entity-relationship modeling. Many modeling notations and most CASE tool...
Trevor H. Jones, Il-Yeol Song
ICCV
2009
IEEE
16 years 11 months ago
Optimal Correspondences from Pairwise Constraints
Correspondence problems are of great importance in computer vision. They appear as subtasks in many applications such as object recognition, merging partial 3D reconstructions a...
Olof Enqvist, Klas Josephson, Fredrik Kahl
ICML
2007
IEEE
16 years 7 months ago
Learning nonparametric kernel matrices from pairwise constraints
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...
Steven C. H. Hoi, Rong Jin, Michael R. Lyu
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
16 years 1 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers