Sciweavers

4716 search results - page 824 / 944
» Iterative-free program analysis
Sort
View
LREC
2010
144views Education» more  LREC 2010»
15 years 5 months ago
Evaluating Complex Semantic Artifacts
Evaluating complex Natural Language Processing (NLP) systems can prove extremely difficult. In many cases, the best one can do is to evaluate these systems indirectly, by looking ...
Christopher R. Walker, Hannah Copperman
NIPS
2008
15 years 5 months ago
Improved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
M. Pawan Kumar, Philip H. S. Torr
SODA
2008
ACM
77views Algorithms» more  SODA 2008»
15 years 5 months ago
Online make-to-order joint replenishment model: primal dual competitive algorithms
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konsta...
SPLC
2008
15 years 5 months ago
Building a Family of Compilers
We have developed and maintained a set of closely related compilers. Although much of their code is duplicated and shared, they have been maintained separately because they are tr...
Wonseok Chae, Matthias Blume
ERSA
2006
147views Hardware» more  ERSA 2006»
15 years 5 months ago
Code Partitioning for Reconfigurable High-Performance Computing: A Case Study
In this case study, various ways to partition a code between the microprocessor and FPGA are examined. Discrete image convolution operation with separable kernel is used as the ca...
Volodymyr V. Kindratenko