Sciweavers

7978 search results - page 552 / 1596
» Combining shared-coin algorithms
Sort
View
PODC
2012
ACM
13 years 9 months ago
Faster randomized consensus with an oblivious adversary
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that gu...
James Aspnes
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
13 years 9 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
AAAI
2012
13 years 9 months ago
Sparse Probabilistic Relational Projection
Probabilistic relational PCA (PRPCA) can learn a projection matrix to perform dimensionality reduction for relational data. However, the results learned by PRPCA lack interpretabi...
Wu-Jun Li, Dit-Yan Yeung
AAAI
2012
13 years 9 months ago
Evaluating Temporal Plans in Incomplete Domains
Recent work on planning in incomplete domains focuses on constructing plans that succeed despite incomplete knowledge of action preconditions and effects. As planning models becom...
Daniel Morwood, Daniel Bryce
AAAI
2012
13 years 9 months ago
Supervised Probabilistic Robust Embedding with Sparse Noise
Many noise models do not faithfully reflect the noise processes introduced during data collection in many real-world applications. In particular, we argue that a type of noise re...
Yu Zhang, Dit-Yan Yeung, Eric P. Xing