Sciweavers

103 search results - page 8 / 21
» High-Probability Syntactic Links
Sort
View
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
15 years 3 months ago
Making Chord Robust to Byzantine Attacks
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Amos Fiat, Jared Saia, Maxwell Young
74
Voted
ISPAN
1999
IEEE
15 years 1 months ago
Sparse Networks Tolerating Random Faults
A network G is called random-fault-tolerant (RFT) network for a network G if G contains a fault-free isomorphic copy of G with high probability even if each processor fails indepe...
Toshinori Yamada, Shuichi Ueno
CORR
2010
Springer
80views Education» more  CORR 2010»
14 years 9 months ago
Multi-path Probabilistic Available Bandwidth Estimation through Bayesian Active Learning
Knowing the largest rate at which data can be sent on an end-to-end path such that the egress rate is equal to the ingress rate with high probability can be very practical when ch...
Frederic Thouin, Mark Coates, Michael Rabbat
CORR
2010
Springer
107views Education» more  CORR 2010»
14 years 9 months ago
Towards Effective Sentence Simplification for Automatic Processing of Biomedical Text
The complexity of sentences characteristic to biomedical articles poses a challenge to natural language parsers, which are typically trained on large-scale corpora of non-technica...
Siddhartha Jonnalagadda, Luis Tari, Jörg Hake...
ICML
2010
IEEE
14 years 10 months ago
Climbing the Tower of Babel: Unsupervised Multilingual Learning
For centuries, scholars have explored the deep links among human languages. In this paper, we present a class of probabilistic models that use these links as a form of naturally o...
Benjamin Snyder, Regina Barzilay