73 search results - page 7 / 15 » Fast Monte Carlo Algorithms for Permutation Groups |
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
ANCS
2006
ACM
14 years 1 months ago
2006
ACM
Clos networks are an important class of switching networks due to their modular structure and much lower cost compared with crossbars. For routing I/O permutations of Clos network...
CSDA
2007
13 years 7 months ago
2007
Recently, there has been a considerable interest in finite mixture models with semi-/non-parametric component distributions. Identifiability of such model parameters is generall...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
A method that combines shape-based object recognition and image segmentation is proposed for shape retrieval from images. Given a shape prior represented in a multiscale curvature...