Sciweavers

3690 search results - page 132 / 738
» Computation with classical sequents
Sort
View
DCC
2001
IEEE
15 years 9 months ago
On Zador's Entropy-Constrained Quantization Theorem
Zador's classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd algorith...
Robert M. Gray, Jia Li
FCT
2007
Springer
15 years 4 months ago
On Block-Wise Symmetric Signatures for Matchgates
We give a classification of block-wise symmetric signatures in the theory of matchgate computations. The main proof technique is matchgate identities, a.k.a. useful Grassmann-Pl¨...
Jin-yi Cai, Pinyan Lu
ICPR
2010
IEEE
15 years 2 months ago
Learning Sparse Face Features : Application to Face Verification
We present a low resolution face recognition technique based on a Convolutional Neural Network approach. The network is trained to reconstruct a reference per subject image. In cl...
Pierre Buyssens, Marinette Revenu
IPPS
1998
IEEE
15 years 2 months ago
Solving the Maximum Clique Problem Using PUBB
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
Yuji Shinano, Tetsuya Fujie, Yoshiko Ikebe, Ryuich...
CONCUR
1998
Springer
15 years 2 months ago
Automata and Coinduction (An Exercise in Coalgebra)
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of universal coalgebr...
Jan J. M. M. Rutten