Sciweavers

2473 search results - page 107 / 495
» The Logic of Communication Graphs
Sort
View
DIALM
2005
ACM
203views Algorithms» more  DIALM 2005»
13 years 11 months ago
Topological hole detection in wireless sensor networks and its applications
The identification of holes in a wireless sensor network is of primary interest since the breakdown of sensor nodes in a larger area often indicates one of the special events to ...
Stefan Funke
FUZZIEEE
2007
IEEE
14 years 3 months ago
Learning Undirected Possibilistic Networks with Conditional Independence Tests
—Approaches based on conditional independence tests are among the most popular methods for learning graphical models from data. Due to the predominance of Bayesian networks in th...
Christian Borgelt
SIROCCO
2001
13 years 10 months ago
Cycle Covering
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...
Jean-Claude Bermond, Lilian Chacon, David Coudert,...
TOG
2008
100views more  TOG 2008»
13 years 9 months ago
Interactive procedural street modeling
This paper addresses the problem of interactively modeling large street networks. We introduce a modeling framework that uses tensor fields to guide the generation of a street gra...
Guoning Chen, Gregory Esch, Peter Wonka, Pascal M&...
TCAD
1998
82views more  TCAD 1998»
13 years 8 months ago
Structural methods for the synthesis of speed-independent circuits
Most existing tools for the synthesisof asynchronouscircuits from Signal Transition Graphs (STGs) derive the reachability graph for the calculation of logic equations. This paper ...
Enric Pastor, Jordi Cortadella, Alex Kondratyev, O...