Sciweavers

2612 search results - page 177 / 523
» Switching Graphs and Their Complexity
Sort
View
ICPR
2002
IEEE
16 years 5 months ago
Relational Graph Labelling Using Learning Techniques and Markov Random Fields
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
Denis Rivière, Jean-Francois Mangin, Jean-M...
ACSAC
2003
IEEE
15 years 9 months 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 2 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
15 years 11 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
ICASSP
2008
IEEE
15 years 10 months ago
A factor graph approach to joint iterative data detection and channel estimation in pilot-assisted IDMA transmissions
We consider a pilot-assisted interleave-division multiple access (IDMA) system transmitting over block-fading channels. We describe this system in terms of a factor graph and use ...
Clemens Novak, Gerald Matz, Franz Hlawatsch