Sciweavers

843 search results - page 8 / 169
» Codes and Projective Multisets
Sort
View
ICASSP
2008
IEEE
14 years 4 months ago
Model-based sparsity projection pursuit for lattice vector quantization
In this work we present an efficient coding scheme suitable for lossy image compression using a lattice vector quantizer (LVQ) based on statistically independent data projections...
Leonardo H. Fonteles, Marc Antonini, Ronald Phlypo
APAL
2010
67views more  APAL 2010»
13 years 10 months ago
Projective mad families
Using almost disjoint coding we prove the consistency of the existence of a 1 2 definable -mad family of infinite subsets of (resp. functions from to ) together with b = 2 = 2.
Sy-David Friedman, Lyubomyr Zdomskyy
AAAI
2012
12 years 6 days ago
Double-Bit Quantization for Hashing
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
Weihao Kong, Wu-Jun Li
OOPSLA
2007
Springer
14 years 4 months ago
CodeGenie: : a tool for test-driven source code search
We present CodeGenie, a tool that implements a test-driven approach to search and reuse of code available on largescale code repositories. With CodeGenie, developers design test c...
Otávio Augusto Lazzarini Lemos, Sushil Kris...
CC
2009
Springer
157views System Software» more  CC 2009»
14 years 2 months ago
Parsing C/C++ Code without Pre-processing
Abstract. It is difficult to develop style-preserving source-to-source transformation engines for C and C++. The main reason is not the complexity of those languages, but the use o...
Yoann Padioleau