Sciweavers

53 search results - page 7 / 11
» Affine Grassmann codes
Sort
View
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 7 months ago
Fast Density Codes for Image Data
Recently, a new method for encoding data sets in the form of "Density Codes" was proposed in the literature (Courrieu, 2006). This method allows to compare sets of points...
Pierre Courrieu
ENDM
2010
86views more  ENDM 2010»
13 years 7 months ago
Mathematical programming based debugging
Verifying that a piece of software has no bugs means proving that it has certain desired properties, such as an array index not taking values outside certain Abstract interpretati...
Leo Liberti, Stéphane Le Roux, Jeremy Lecon...
PAMI
2012
11 years 10 months ago
Face Recognition Using Sparse Approximated Nearest Points between Image Sets
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...
Yiqun Hu, Ajmal S. Mian, Robyn A. Owens
ICIP
2005
IEEE
14 years 9 months ago
Motion vector prediction in multiview video coding
In video coding, motion vectors always account for a large number of bits and affect coding efficiency largely. In this paper, we propose an efficient motion vector prediction algo...
Xun Guo, Wen Gao, Debin Zhao
ECCC
2010
83views more  ECCC 2010»
13 years 4 months ago
Symmetric LDPC codes are not necessarily locally testable
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu ...