Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
7,756
Similarity graphs
- In Proceedings of ISMIS’03, volume LNAI 2871
, 2003
"... Abstract. The focus of this paper is approaches to measuring similarity for application in content-based query evaluation. Rather than only comparing at the level of words, the issue here is conceptual resemblance. The basis is a knowledge base defining major concepts of the domain and may include t ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
Abstract. The focus of this paper is approaches to measuring similarity for application in content-based query evaluation. Rather than only comparing at the level of words, the issue here is conceptual resemblance. The basis is a knowledge base defining major concepts of the domain and may include
Growth of self-similar graphs
, 2001
"... Abstract. Locally finite self-similar graphs with bounded geometry and without bounded geometry as well as non-locally finite self-similar graphs are characterized by the structure of their cell graphs. Geometric properties concerning the volume growth and distances in cell graphs are discussed. The ..."
Abstract
-
Cited by 13 (3 self)
- Add to MetaCart
Abstract. Locally finite self-similar graphs with bounded geometry and without bounded geometry as well as non-locally finite self-similar graphs are characterized by the structure of their cell graphs. Geometric properties concerning the volume growth and distances in cell graphs are discussed
Growth of Self-Similar Graphs
, 2002
"... Abstract: Locally finite self-similar graphs with bounded geometry and without bounded geometry as well as non-locally finite self-similar graphs are characterized by the structure of their cell graphs. Geometric properties concerning the volume growth and distances in cell graphs are discussed. The ..."
Abstract
- Add to MetaCart
Abstract: Locally finite self-similar graphs with bounded geometry and without bounded geometry as well as non-locally finite self-similar graphs are characterized by the structure of their cell graphs. Geometric properties concerning the volume growth and distances in cell graphs are discussed
Growth of self-similar graphs
, 2002
"... Geometric properties of self-similar graphs concerning their volume growth and distances in certain finite subgraphs are discussed. The length scaling factor ν and the volume scaling factor µ can be defined similarly to the corresponding parameters of continuous self-similar sets. There are differen ..."
Abstract
- Add to MetaCart
Geometric properties of self-similar graphs concerning their volume growth and distances in certain finite subgraphs are discussed. The length scaling factor ν and the volume scaling factor µ can be defined similarly to the corresponding parameters of continuous self-similar sets
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
, 2002
"... Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching algorithm based on a fixpoint computation that is usable across different scenarios. The algorithm takes two graphs (sch ..."
Abstract
-
Cited by 592 (12 self)
- Add to MetaCart
Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching algorithm based on a fixpoint computation that is usable across different scenarios. The algorithm takes two graphs
Construction of abstract state graphs with PVS
, 1997
"... We describe in this paper a method based on abstract interpretation which, from a theoretical point of view, is similar to the splitting methods proposed in [DGG93, Dam96] but the weaker abstract transition relation we use, allows us to construct automatically abstract state graphs paying a reasonab ..."
Abstract
-
Cited by 742 (10 self)
- Add to MetaCart
We describe in this paper a method based on abstract interpretation which, from a theoretical point of view, is similar to the splitting methods proposed in [DGG93, Dam96] but the weaker abstract transition relation we use, allows us to construct automatically abstract state graphs paying a
Graph-based algorithms for Boolean function manipulation
- IEEE TRANSACTIONS ON COMPUTERS
, 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract
-
Cited by 3526 (46 self)
- Add to MetaCart
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions
Unsupervised Visual Alignment with Similarity Graphs
"... Alignment of semantically meaningful visual patterns, such as object classes, is an important pre-processing step for a number of applications such as object detection and im-age categorization. Considering the expensive manpower spent on the annotation for supervised alignment methods, unsupervised ..."
Abstract
- Add to MetaCart
”). In this work, we overcome the aforementioned drawbacks by defining visual similarity under the generalized assignment problem which is solved by fast approximation and non-linear optimization. From pair-wise image similarities we construct an image graph which is used to step-wise align, “morph”, an image
Enumeration problems for classes of self-similar graphs
- MR MR2353122
"... Abstract. We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of recurrences and provide methods to solve these recurrences asymptotically. This is shown for different examples i ..."
Abstract
-
Cited by 9 (6 self)
- Add to MetaCart
Abstract. We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of recurrences and provide methods to solve these recurrences asymptotically. This is shown for different examples
Results 1 - 10
of
7,756
