Sciweavers

80 search results - page 16 / 16
» Resource-bounded measure on probabilistic classes
Sort
View
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
13 years 9 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
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
13 years 9 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
FOCS
1995
IEEE
13 years 9 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
BMCBI
2006
126views more  BMCBI 2006»
13 years 5 months ago
A Regression-based K nearest neighbor algorithm for gene function prediction from heterogeneous data
Background: As a variety of functional genomic and proteomic techniques become available, there is an increasing need for functional analysis methodologies that integrate heteroge...
Zizhen Yao, Walter L. Ruzzo
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 6 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori