Sciweavers

111 search results - page 4 / 23
» From irreducible representations to locally decodable codes
Sort
View
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 1 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
PROPERTYTESTING
2010
13 years 5 months ago
Short Locally Testable Codes and Proofs: A Survey in Two Parts
We survey known results regarding locally testable codes and locally testable proofs (known as PCPs), with emphasis on the length of these constructs. Local testability refers to a...
Oded Goldreich
GLOBECOM
2006
IEEE
14 years 1 months ago
High-rate, Double-Symbol-Decodable STBCs from Clifford Algebras
— For the number of transmit antennas N = 2a the maximum rate (in complex symbols per channel use) of all the Quasi-Orthogonal Designs (QODs) reported in the literature is a 2aâˆ...
Sanjay Karmakar, B. Sundar Rajan
IJCV
2007
363views more  IJCV 2007»
13 years 7 months ago
Image Analysis and Reconstruction using a Wavelet Transform Constructed from a Reducible Representation of the Euclidean Motion
Abstract. Inspired by the early visual system of many mammalians we consider the construction of-and reconstruction from- an orientation score Uf : R2 ×S1 → C as a local orienta...
Remco Duits, Michael Felsberg, Gösta H. Granl...
WACV
2012
IEEE
12 years 3 months ago
Online discriminative object tracking with local sparse representation
We propose an online algorithm based on local sparse representation for robust object tracking. Local image patches of a target object are represented by their sparse codes with a...
Qing Wang, Feng Chen, Wenli Xu, Ming-Hsuan Yang