Sciweavers

4009 search results - page 321 / 802
» Clustering on Complex Graphs
Sort
View
GG
2008
Springer
15 years 7 months ago
Graph Transformation for Topology Modelling
In this paper we present meta-rules to express an infinite class of semantically related graph transformation rules in the context of pure topological modelling with G-maps. Our p...
Mathieu Poudret, Agnès Arnould, Jean-Paul C...
CORR
2008
Springer
74views Education» more  CORR 2008»
15 years 6 months ago
Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...
Éric Colin de Verdière, Alexander Sc...
ACSAC
2003
IEEE
16 years 1 days ago
Efficient Minimum-Cost Network Hardening Via Exploit Dependency Graphs
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
Steven Noel, Sushil Jajodia, Brian O'Berry, Michae...
HAPTICS
2010
IEEE
15 years 4 months ago
A New Coupling Scheme for Haptic Rendering of Rigid Bodies Interactions Based on a Haptic Sub-world Using a Contact Graph
Interactions with virtual worlds using the sense of touch, called haptic rendering, have natural applications in many domains such as health or industry. For an accurate and realis...
Loeiz Glondu, Maud Marchal, Georges Dumont
ICASSP
2009
IEEE
16 years 1 months ago
Factor graph based design of an OFDM-IDMA receiver performing joint data detection, channel estimation, and channel length selec
We present a factor graph based design of a receiver for pilotassisted OFDM-IDMA systems transmitting over frequency-selective channels. The receiver performs joint iterative mult...
Clemens Novak, Gerald Matz, Franz Hlawatsch