Sciweavers

2996 search results - page 415 / 600
» Numberings and Randomness
Sort
View
CN
2008
98views more  CN 2008»
15 years 6 months ago
Description and simulation of dynamic mobility networks
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
Antoine Scherrer, Pierre Borgnat, Eric Fleury, Jea...
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 6 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
197
Voted
ADHOC
2006
97views more  ADHOC 2006»
15 years 6 months ago
A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris...
BMCBI
2006
165views more  BMCBI 2006»
15 years 6 months ago
Improved variance estimation of classification performance via reduction of bias caused by small sample size
Background: Supervised learning for classification of cancer employs a set of design examples to learn how to discriminate between tumors. In practice it is crucial to confirm tha...
Ulrika Wickenberg-Bolin, Hanna Göransson, M&a...
BMCBI
2007
153views more  BMCBI 2007»
15 years 6 months ago
Lower bounds on multiple sequence alignment using exact 3-way alignment
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
Charles J. Colbourn, Sudhir Kumar