Sciweavers

2412 search results - page 197 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
139
Voted
FSTTCS
2006
Springer
15 years 7 months ago
Some Results on Average-Case Hardness Within the Polynomial Hierarchy
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran
120
Voted
IQ
2001
15 years 5 months ago
Information Envelope and its Information Integrity Implications
: Physical and informational works are strongly interrelated in a business process. This facilitates modeling a business process as an integral part of a closed loop information an...
Vijay V. Mandke, Madhavan K. Nayar, Kamna Malik
130
Voted
JMM2
2007
96views more  JMM2 2007»
15 years 3 months ago
A Framework for Linear Transform Approximation Using Orthogonal Basis Projection
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
Yinpeng Chen, Hari Sundaram
123
Voted
STOC
2010
ACM
195views Algorithms» more  STOC 2010»
15 years 7 months ago
Efficiently Learning Mixtures of Two Gaussians
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We provide a polynomial-time algorithm for this proble...
Adam Tauman Kalai, Ankur Moitra, and Gregory Valia...
136
Voted
BMCBI
2006
99views more  BMCBI 2006»
15 years 3 months ago
Genetic algorithm learning as a robust approach to RNA editing site prediction
Background: RNA editing is one of several post-transcriptional modifications that may contribute to organismal complexity in the face of limited gene complement in a genome. One f...
James Thompson, Shuba Gopal