Sciweavers

934 search results - page 54 / 187
» Quantum Algorithmic Entropy
Sort
View
NIPS
2004
13 years 10 months ago
Mistake Bounds for Maximum Entropy Discrimination
We establish a mistake bound for an ensemble method for classification based on maximizing the entropy of voting weights subject to margin constraints. The bound is the same as a ...
Philip M. Long, Xinyu Wu
ICALP
2001
Springer
14 years 1 months ago
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
Peter Høyer, Jan Neerbek, Yaoyun Shi
SSIAI
2002
IEEE
14 years 1 months ago
Entropy Estimation for Segmentation of Multi-Spectral Chromosome Images
In the early 1990s, the state-of-the-art in commercial chromosome image acquisition was grayscale. Automated chromosome classification was based on the grayscale image and boundar...
Wade Schwartzkopf, Brian L. Evans, Alan C. Bovik
COMPUTER
2002
79views more  COMPUTER 2002»
13 years 8 months ago
A Practical Architecture for Reliable Quantum Computers
wever, by using a simple model of abstract building blocks: quantum bits, gates, and algorithms, and the available implementation technologies--in all their imperfections.7 The bas...
Mark Oskin, Frederic T. Chong, Isaac L. Chuang
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 6 months ago
QIP = PSPACE
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and Jo...