Sciweavers

1722 search results - page 26 / 345
» On the sample mean of graphs
Sort
View
LREC
2010
163views Education» more  LREC 2010»
14 years 11 months ago
Meaning Representation: From Continuity to Discreteness
This paper presents a geometric approach to meaning representation within the framework of continuous mathematics. Meaning representation is a central issue in Natural Language Pr...
Fabienne Venant
DIAGRAMS
2006
Springer
15 years 1 months ago
Fixing Shin's Reading Algorithm for Peirce's Existential Graphs
In her book "The Iconic Logic of Peirce's Graphs", S. J. Shin elaborates the diagrammatic logic of Peirce's Existential Graphs. Particularly, she provides trans...
Frithjof Dau
BIRTHDAY
2008
Springer
15 years 1 hour ago
Graph Transformation Units - An Overview
In this paper, we give an overview of the framework of graph transformation units which provides syntactic and semantic means for analyzing, modeling, and structuring all kinds of ...
Hans-Jörg Kreowski, Sabine Kuske, Grzegorz Ro...
INFORMATICALT
2007
80views more  INFORMATICALT 2007»
14 years 10 months ago
Recognition Algorithm for Diamond-Free Graphs
In this paper we recall the notion of weakly decomposition, we recall some necessary and sufficient conditions for a graph to admit such a decomposition, we introduce the recognit...
Mihai Talmaciu, Elena Nechita
ICCV
2001
IEEE
15 years 12 months ago
Image Segmentation with Minimum Mean Cut
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...
Song Wang, Jeffrey Mark Siskind