1188 search results - page 82 / 238 » Extended Graph Unification |
176
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize th...
147
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper we present methods for downsampling datasets defined on graphs (i.e., graph-signals) by extending downsampling results for traditional N-dimensional signals. In par...
154
click to vote
FLAIRS
2008
15 years 8 months ago
2008
The paper presents a new approach to the problem of paraphrase identification. The new approach extends a previously proposed method for the task of textual entailment. The relati...
154
click to vote
SIAMDM
2008
15 years 6 months ago
2008
A hypergraph pair is a pair (G, H) where G and H are hypergraphs on the same set of vertices. We extend the definitions of hypertree-width [7] and generalised hypertree-width [8] ...
273
click to vote
AWIC
2011
Springer
14 years 9 months ago
2011
Springer
Abstract. In this paper, we introduce DegExt, a graph-based languageindependent keyphrase extractor,which extends the keyword extraction method described in [6]. We compare DegExt ...