Sciweavers

227 search results - page 10 / 46
» Deterministic Sampling Algorithms for Network Design
Sort
View
AINA
2007
IEEE
15 years 3 months ago
Data Stream Based Algorithms For Wireless Sensor Network Applications
Abstract— A wireless sensor network (WSN) is energy constrained, and the extension of its lifetime is one of the most important issues in its design. Usually, a WSN collects a la...
André L. L. de Aquino, Carlos Mauricio S. F...
INFOCOM
2010
IEEE
14 years 8 months ago
Optimal Linear Network Coding Design for Secure Unicast with Multiple Streams
—Linear network coding is a promising technology that can maximize the throughput capacity of communication network. Despite this salient feature, there are still many challenges...
Jin Wang, Jianping Wang, Kejie Lu, Bin Xiao, Naiji...
VTS
2006
IEEE
122views Hardware» more  VTS 2006»
15 years 3 months ago
Early, Accurate and Fast Yield Estimation through Monte Carlo-Alternative Probabilistic Behavioral Analog System Simulations
Monte Carlo analysis has so far been the corner stone for analog statistical simulations. Fast and accurate simulations are necessary for stringent time-to-market, design for manu...
Rasit Onur Topaloglu
DEDS
2008
108views more  DEDS 2008»
14 years 9 months ago
An Algorithmic Toolbox for Network Calculus
Network calculus offers powerful tools to analyze the performances in communication networks, in particular to obtain deterministic bounds. This theory is based on a strong mathema...
Anne Bouillard, Eric Thierry
WABI
2005
Springer
143views Bioinformatics» more  WABI 2005»
15 years 2 months ago
A Faster Algorithm for Detecting Network Motifs
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
Sebastian Wernicke