2168 search results - page 47 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
ASPLOS
2012
ACM
12 years 4 months ago
2012
ACM
Disciplined approximate programming lets programmers declare which parts of a program can be computed approximately and consequently at a lower energy cost. The compiler proves st...
NIPS
2007
13 years 10 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
In this work we present a model that uses a Dirichlet Process (DP) with a dynamic spatial constraints to approximate a non-homogeneous hidden Markov model (NHMM). The coefficient ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
ISCAS
2007
IEEE
14 years 3 months ago
2007
IEEE
— In this paper, a modified version of the complex directional pyramid (PDTDFB) is proposed. Unlike the previous approach, the new FB provides an approximately tight-frame decom...