2168 search results - page 9 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
VLSISP
2010
13 years 6 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...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
COLING
2000
13 years 9 months ago
2000
This paper describes a method to find phraselevel translation patterns from parallel corpora by applying dependency structure analysis. We use statistical dependency parsers to de...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...