692 search results - page 32 / 139 » BDD minimization for approximate computing |
FOCS
2008
IEEE
15 years 5 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
EUROPAR
2010
Springer
14 years 10 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties wan...
NIPS
2007
14 years 12 months ago
2007
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...
VLSISP
2010
14 years 9 months ago
2010
— This paper presents ALA (Adaptable Logarithm Approximation), a novel hardware architecture for the approximation of the base-2 logarithm of integers at an arbitrary accuracy, s...