Sciweavers

152 search results - page 2 / 31
» Similarity Matrices for Pairs of Graphs
Sort
View
APVIS
2007
13 years 6 months ago
Interpreting large visual similarity matrices
Visual similarity matrices (VSMs) are a common technique for visualizing graphs and other types of relational data. While traditionally used for small data sets or well-ordered la...
Christopher Mueller, Benjamin Martin, Andrew Lumsd...
SODA
2012
ACM
191views Algorithms» more  SODA 2012»
11 years 7 months ago
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sha...
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 5 months ago
The Parallel-Sequential Duality : Matrices and Graphs
Abstract. Usually, mathematical objects have highly parallel interpretations. In this paper, we consider them as sequential constructors of other objects. In particular, we prove t...
Serge Burckel
SSD
2001
Springer
103views Database» more  SSD 2001»
13 years 9 months ago
Similarity of Cardinal Directions
Like people who casually assess similarity between spatial scenes in their routine activities, users of pictorial databases are often interested in retrieving scenes that are simil...
Roop K. Goyal, Max J. Egenhofer
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