2661 search results - page 91 / 533 » Quantum Complexity Classes |
99
Voted
COMPUTING
2006
15 years 26 days ago
2006
Sparse grid methods represent a powerful and efficient technique for the representation and approximation of functions and particularly the solutions of partial differential equat...
102
click to vote
ICFP
2010
ACM
15 years 1 months ago
2010
ACM
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
125
click to vote
AI
2002
Springer
15 years 21 days ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
145
click to vote
COLT
1993
Springer
15 years 5 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
GPCE
2009
Springer
15 years 5 months ago
2009
Springer
The indirection of object accesses is a common theme for target domains as diverse as transparent distribution, persistence, and program instrumentation. Virtualizing accesses to ...