29 search results - page 4 / 6 » Index coding via linear programming |
CSCLP
2004
Springer
13 years 11 months ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We propose an approach to lossy source coding, utilizing ideas from Gibbs sampling, simulated annealing, and Markov Chain Monte Carlo (MCMC). The idea is to sample a reconstructio...
SIGIR
2010
ACM
13 years 10 months ago
2010
ACM
The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. A promising way to accelerate similarity search is sem...
DAC
1997
ACM
13 years 10 months ago
1997
ACM
—Many application-specific architectures provide indirect addressing modes with auto-increment/decrement arithmetic. Since these architectures generally do not feature an indexe...
APLAS
2005
ACM
13 years 12 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...