Sciweavers

2168 search results - page 432 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
CCR
2010
184views more  CCR 2010»
14 years 11 months ago
Characterising temporal distance and reachability in mobile and online social networks
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
John Tang, Mirco Musolesi, Cecilia Mascolo, Vito L...
BMCBI
2007
166views more  BMCBI 2007»
14 years 11 months ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour
PERVASIVE
2008
Springer
14 years 11 months ago
Localized power-aware routing in linear wireless sensor networks
Energy-efficency is a key concern when designing protocols for wireless sensor networks (WSN). This is of particular importance in commercial applications where demonstrable retur...
Marco Zimmerling, Waltenegus Dargie, Johnathan M. ...
107
Voted
BMCBI
2004
190views more  BMCBI 2004»
14 years 11 months ago
RAG: RNA-As-Graphs web resource
Background: The proliferation of structural and functional studies of RNA has revealed an increasing range of RNA's structural repertoire. Toward the objective of systematic ...
Daniela Fera, Namhee Kim, Nahum Shiffeldrim, Julie...
FSS
2002
84views more  FSS 2002»
14 years 11 months ago
A possibilistic approach to selecting portfolios with highest utility score
The mean-variance methodology for the portfolio selection problem, originally proposed by Markowitz, has been one of the most important research fields in modern finance. In this ...
Christer Carlsson, Robert Fullér, Pé...