Sciweavers

778 search results - page 61 / 156
» Improved universal denominators
Sort
View
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
15 years 1 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
SIGUCCS
2000
ACM
15 years 1 months ago
Developing and Implementing a Comprehensive Training and Incentive Program for Student Employees in Information Technology
Anyone who works with student employees knows that while it is often difficult to train sufficiently, it is of the utmost importance to have a qualified, knowledgeable staff. We w...
Jim Osborn
ARSCOM
2007
63views more  ARSCOM 2007»
14 years 10 months ago
Towards a Characterisation of Lottery Set Overlapping Structures
Consider a lottery scheme consisting of randomly selecting a winning t–set from a universal m–set, while a player participates in the scheme by purchasing a playing set of any...
Alewyn P. Burger, W. R. Grundlingh, Jan H. van Vuu...
CLASSIFICATION
2006
108views more  CLASSIFICATION 2006»
14 years 9 months ago
The Practice of Cluster Analysis
Abstracts "Mixtures at the Interface" David Scott, Rice University Mixture modeling provides an effective framework for complex, high-dimensional data. The potential of m...
Jon R. Kettenring
CORR
2007
Springer
90views Education» more  CORR 2007»
14 years 9 months ago
Discrete Denoising with Shifts
We introduce S-DUDE, a new algorithm for denoising Discrete Memoryless Channel (DMC)-corrupted data. The algorithm, which generalizes the recently introduced DUDE (Discrete Univer...
Taesup Moon, Tsachy Weissman