We consider equation systems of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where f1, . . . , fn are polynomials with positive real coefficients. In vector fo...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
The increasing levels of system integration in Multi-Processor System-on-Chips (MPSoCs) emphasize the need for new design flows for efficient mapping of multi-task applications o...
Formal languages for probabilistic modeling enable re-use, modularity, and descriptive clarity, and can foster generic inference techniques. We introduce Church, a universal langu...
Noah Goodman, Vikash K. Mansinghka, Daniel M. Roy,...
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
Applying the right compiler optimizations to a particular program can have a significant impact on program performance. Due to the non-linear interaction of compiler optimization...
John Cavazos, Grigori Fursin, Felix V. Agakov, Edw...