Sciweavers

242 search results - page 39 / 49
» Distributed algorithms with dynamical random transitions
Sort
View
BMCBI
2007
148views more  BMCBI 2007»
14 years 11 months ago
Computation of significance scores of unweighted Gene Set Enrichment Analyses
Background: Gene Set Enrichment Analysis (GSEA) is a computational method for the statistical evaluation of sorted lists of genes or proteins. Originally GSEA was developed for in...
Andreas Keller, Christina Backes, Hans-Peter Lenho...
MOBIHOC
2006
ACM
15 years 11 months ago
Data storage placement in sensor networks
Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. This paper introduces stora...
Bo Sheng, Qun Li, Weizhen Mao
INFOCOM
2008
IEEE
15 years 6 months ago
Wireless Medium Access via Adaptive Backoff: Delay and Loss Minimization
— We consider packet transmission scheduling at the MAC-layer via adaptive backoff algorithms that are favorable in terms of queue occupancies in a wireless network. General netw...
Gardar Hauksson, Murat Alanyali
ICDCS
2009
IEEE
15 years 8 months ago
ISP Friend or Foe? Making P2P Live Streaming ISP-Aware
Abstract: Current peer-to-peer systems are network-agnostic, often generating large volumes of unnecessary inter-ISP traffic. Although recent work has shown the benefits of ISP-a...
Fabio Picconi, Laurent Massoulié
ICPPW
2006
IEEE
15 years 5 months ago
Parallel Implementation of the Polyhedral Homotopy Method
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
Jan Verschelde, Yan Zhuang