Sciweavers

780 search results - page 104 / 156
» Robustness and Randomness
Sort
View
DAC
2007
ACM
14 years 10 months ago
Synthesizing Stochasticity in Biochemical Systems
Randomness is inherent to biochemistry: at each instant, the sequence of reactions that fires is a matter of chance. Some biological systems exploit such randomness, choosing betw...
Brian Fett, Jehoshua Bruck, Marc D. Riedel
LICS
2002
IEEE
14 years 1 months ago
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...
Sophie Laplante, Richard Lassaigne, Fréd&ea...
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
14 years 1 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
TCOM
2010
107views more  TCOM 2010»
13 years 7 months ago
A Simple Recruitment Scheme of Multiple Nodes for Cooperative MAC
—Physical (PHY) layer cooperation in a wireless network allows neighboring nodes to share their communication resources in order to create a virtual antenna array by means of dis...
Francesco Verde, Thanasis Korakis, Elza Erkip, Ann...
ICDCN
2011
Springer
13 years 11 days ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...