Sciweavers

328 search results - page 48 / 66
» Algorithms for the edge-width of an embedded graph
Sort
View
DIALM
2004
ACM
100views Algorithms» more  DIALM 2004»
15 years 3 months ago
Virtual coordinates for ad hoc and sensor networks
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
Thomas Moscibroda, Regina O'Dell, Mirjam Wattenhof...
COMSWARE
2008
IEEE
14 years 11 months ago
Extracting dense communities from telecom call graphs
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...
Vinayaka Pandit, Natwar Modani, Sougata Mukherjea,...
IPSN
2011
Springer
14 years 28 days ago
Exploration of path space using sensor network geometry
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
Ruirui Jiang, Xiaomeng Ban, Mayank Goswami, Wei Ze...
IESS
2007
Springer
162views Hardware» more  IESS 2007»
15 years 3 months ago
Automatic Parallelization of Sequential Specifications for Symmetric MPSoCs
Abstract This paper presents an embedded system design toolchain for automatic generation of parallel code runnable on symmetric multiprocessor systems from an initial sequential s...
Fabrizio Ferrandi, Luca Fossati, Marco Lattuada, G...
TCAD
2002
98views more  TCAD 2002»
14 years 9 months ago
An Esterel compiler for large control-dominated systems
Embedded hard real-time software systems often need fine-grained parallelism and precise control of timing, things typical real-time operating systems do not provide. The Esterel l...
Stephen A. Edwards