Sciweavers

187 search results - page 2 / 38
» On the Natural Imprint Function of a Graph
Sort
View
DCG
2007
83views more  DCG 2007»
13 years 5 months ago
The Genus of a Digital Image Boundary Is Determined by Its Foreground, Background, and Reeb Graphs
Weprovethatthegenusoftheboundaryofadigitalimageispreciselyhalfofthe sum of the cycle ranks of three particular graphs: the “foreground graph” and “background graph,” which ...
Lowell Abrams, Donniell E. Fishkind
NIPS
2003
13 years 6 months ago
Kernels for Structured Natural Language Data
This paper devises a novel kernel function for structured natural language data. In the field of Natural Language Processing, feature extraction consists of the following two ste...
Jun Suzuki, Yutaka Sasaki, Eisaku Maeda
GC
2010
Springer
13 years 3 months ago
Integer Functions on the Cycle Space and Edges of a Graph
A directed graph has a natural Z-module homomorphism from the underlying graph’s cycle space to Z where the image of an oriented cycle is the number of forward edges minus the n...
Daniel C. Slilaty
CVPR
2011
IEEE
13 years 23 days ago
Submodularity beyond submodular energies: coupling edges in graph cuts
We propose a new family of non-submodular global energy functions that still use submodularity internally to couple edges in a graph cut. We show it is possible to develop an ef...
Stefanie Jegelka, Jeff Bilmes
EMNLP
2009
13 years 3 months ago
Efficient kernels for sentence pair classification
In this paper, we propose a novel class of graphs, the tripartite directed acyclic graphs (tDAGs), to model first-order rule feature spaces for sentence pair classification. We in...
Fabio Massimo Zanzotto, Lorenzo Dell'Arciprete