Sciweavers

3690 search results - page 59 / 738
» Computation with classical sequents
Sort
View
CVPR
2012
IEEE
13 years 6 days ago
Learning sparse covariance patterns for natural scenes
For scene classification, patch-level linear features do not always work as well as handcrafted features. In this paper, we present a new model to greatly improve the usefulness ...
Liwei Wang, Yin Li, Jiaya Jia, Jian Sun, David Wip...
NN
2008
Springer
14 years 9 months ago
Some neural networks compute, others don't
I address whether neural networks perform computations in the sense of computability theory and computer science. I explicate and defend the following theses. (1) Many neural netw...
Gualtiero Piccinini
STOC
2002
ACM
130views Algorithms» more  STOC 2002»
15 years 10 months ago
Secure multi-party quantum computation
Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation...
Claude Crépeau, Daniel Gottesman, Adam Smit...
ACMSE
2006
ACM
15 years 1 months ago
Revisiting a limit on efficient quantum computation
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
Tarsem S. Purewal Jr.
IJCAI
2003
14 years 11 months ago
Recycling Computed Answers in Rewrite Systems for Abduction
In rule-based systems, goal-oriented computations correspond naturally to the possible ways that an observation may be explained. In some applications, we need to compute explanat...
Fangzhen Lin, Jia-Huai You