494 search results - page 67 / 99 » Probabilistic Programming in Anglican |
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
IJPP
2011
14 years 1 months ago
2011
Tuning compiler optimizations for rapidly evolving hardware makes porting and extending an optimizing compiler for each new platform extremely challenging. Iterative optimization i...
CSMR
2004
IEEE
15 years 1 months ago
2004
IEEE
Combining static and dynamic information is highly relevant in many reverse engineering, program comprehension and maintenance task. Dynamic analysis is particularly effective whe...
CPAIOR
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
75
Voted
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
Hyperspectral unmixing is a process of extracting hidden spectral signatures (or endmembers) and the corresponding proportions (or abundances) of a scene, from its hyperspectral o...