Sciweavers

1370 search results - page 19 / 274
» On grids in topological graphs
Sort
View
COSIT
2009
Springer
129views GIS» more  COSIT 2009»
14 years 3 months ago
Semi-automated Derivation of Conceptual Neighborhood Graphs of Topological Relations
Conceptual neighborhood graphs are similarity-based schemata of spatial/temporal relations. This paper proposes a semi-automated method for deriving a conceptual neighborhood graph...
Yohei Kurata
GD
2009
Springer
13 years 11 months ago
Complexity of Some Geometric and Topological Problems
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
Marcus Schaefer
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
14 years 8 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
DM
2000
89views more  DM 2000»
13 years 8 months ago
On median graphs and median grid graphs
Let G be a Q4-free median graph on n vertices and m edges. Let k be the number of equivalence classes of Djokovi
Sandi Klavzar, Riste Skrekovski
TSP
2010
13 years 3 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat