Sciweavers

780 search results - page 153 / 156
» Robustness and Randomness
Sort
View
TWC
2008
135views more  TWC 2008»
13 years 8 months ago
Optimal Distributed Stochastic Routing Algorithms for Wireless Multihop Networks
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
Alejandro Ribeiro, Nikolas D. Sidiropoulos, Georgi...
BMCBI
2004
90views more  BMCBI 2004»
13 years 8 months ago
Statistical monitoring of weak spots for improvement of normalization and ratio estimates in microarrays
Background: Several aspects of microarray data analysis are dependent on identification of genes expressed at or near the limits of detection. For example, regression-based normal...
Igor Dozmorov, Nicholas Knowlton, Yuhong Tang, Mic...
JAR
2000
145views more  JAR 2000»
13 years 8 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
TON
1998
103views more  TON 1998»
13 years 8 months ago
Using name-based mappings to increase hit rates
—Clusters of identical intermediate servers are often created to improve availability and robustness in many domains. The use of proxy servers for the World Wide Web (WWW) and of...
David Thaler, Chinya V. Ravishankar
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 8 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy