Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Computational problem
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Computational complexity theory is the study of the minimal resources needed to solve computational problems. In particular, it… Expand
Highly Cited
2001
Highly Cited
2001
Theoretical neuroscience provides a quantitative basis for describing what nervous systems do, determining how they function, and… Expand
Review
2001
Review
2001
The growth of the Internet has triggered tremendous opportunities for cooperative computation, where people are jointly… Expand
Highly Cited
2000
Highly Cited
2000
This paper presents a new variational framework for detecting and tracking multiple moving objects in image sequences. Motion… Expand
Highly Cited
1999
Highly Cited
1999
We examine the theory and behavior in practice of Bayesian and bootstrap methods for generating error bands on impulse responses… Expand
Highly Cited
1998
Highly Cited
1998
Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then… Expand
Highly Cited
1998
Highly Cited
1998
From the Publisher:
Lewis and Papadimitriou present this long awaited Second Edition of their best-selling theory of computation… Expand
Highly Cited
1993
Highly Cited
1993
Once we have developed an algorithm (q.v.) for solving a computational problem and analyzed its worst-case time requirements as a… Expand
Highly Cited
1972
Highly Cited
1972
University of California at Berkeley. Abstract: A large class of computational problems.Since 1999 at UC Berkeley. Computational… Expand
Highly Cited
1964
Highly Cited
1964
We describe the numerical methods required in our approach to multi-dimensional scaling. The rationale of this approach has… Expand
