Sciweavers

3690 search results - page 134 / 738
» Computation with classical sequents
Sort
View
DAGSTUHL
2006
14 years 11 months ago
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
Howard Barnum
COMBINATORICS
2007
92views more  COMBINATORICS 2007»
14 years 10 months ago
Compact Hyperbolic Coxeter n-Polytopes with n+3 Facets
We use methods of combinatorics of polytopes together with geometrical and computational ones to obtain the complete list of compact hyperbolic Coxeter npolytopes with n + 3 facet...
Pavel Tumarkin
NECO
2006
118views more  NECO 2006»
14 years 10 months ago
Consistency of Pseudolikelihood Estimation of Fully Visible Boltzmann Machines
Boltzmann machine is a classic model of neural computation, and a number of methods have been proposed for its estimation. Most methods are plagued by either very slow convergence...
Aapo Hyvärinen
SIAMDM
2010
99views more  SIAMDM 2010»
14 years 8 months ago
Reductions of Young Tableau Bijections
We introduce notions of linear reduction and linear equivalence of bijections for the purposes of study bijections between Young tableaux. Originating in Theoretical Computer Scie...
Igor Pak, Ernesto Vallejo
CVPR
2011
IEEE
14 years 6 months ago
Robust Sparse Coding for Face Recognition
Recently the sparse representation (or coding) based classification (SRC) has been successfully used in face recognition. In SRC, the testing image is represented as a sparse lin...
Meng Yang, Lei Zhang