Sciweavers

736 search results - page 54 / 148
» Distinguishing geometric graphs
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
14 years 12 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...
MONET
2006
157views more  MONET 2006»
14 years 11 months ago
Connectivity in Wireless Ad-hoc Networks with a Log-normal Radio Model
In this paper we study connectivity in wireless ad-hoc networks by modeling the network as an undirected geometric random graph. The novel aspect in our study is that for finding t...
Ramin Hekmat, Piet Van Mieghem
COSIT
2009
Springer
129views GIS» more  COSIT 2009»
15 years 6 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
ETFA
2008
IEEE
15 years 6 months ago
Automatic generation of bond graph models of process plants
This paper presents an application for the automatic generation of Bond Graph models. The basis for this automated creation is a modified plant model in the XML-format according t...
Sebastian Beez, Alexander Fay, Nina F. Thornhill
GD
2004
Springer
15 years 5 months ago
QUOGGLES: Query On Graphs - A Graphical Largely Extensible System
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...
Paul Holleis, Franz-Josef Brandenburg