Sciweavers

1449 search results - page 87 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
15 years 7 months ago
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
Bruce M. Kapron, David Kempe, Valerie King, Jared ...
NIPS
2004
15 years 7 months ago
Euclidean Embedding of Co-Occurrence Data
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
Amir Globerson, Gal Chechik, Fernando C. Pereira, ...
AAAI
2000
15 years 7 months ago
Solving Combinatorial Auctions Using Stochastic Local Search
Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determ...
Holger H. Hoos, Craig Boutilier
ACL
1998
15 years 7 months ago
Alignment of Multiple Languages for Historical Comparison
An essential step in comparative reconstruction is to align corresponding phonological segments in the words being compared. To do this, one must search among huge numbers of pote...
Michael A. Covington
FORTE
1998
15 years 7 months ago
Issues in conformance testing: multiple semicontrollable interfaces
In a testing environment, where an IUT communicates with multiple entities, a tester may have di ering degrees of controllability on the interactions between these entities and th...
Mariusz A. Fecko, M. Ümit Uyar, Adarshpal S. ...