692 search results - page 51 / 139 » BDD minimization for approximate computing |
82
Voted
ICPR
2008
IEEE
15 years 5 months ago
2008
IEEE
Frames of videos with static background and dynamic foreground can be viewed as samples of signals that vary slowly in time with sparse corruption caused by foreground objects. We...
ICASSP
2011
IEEE
14 years 2 months ago
2011
IEEE
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
CVPR
2012
IEEE
13 years 1 months ago
2012
IEEE
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
ICML
2010
IEEE
14 years 12 months ago
2010
IEEE
We present a new algorithm for minimizing a convex loss-function subject to regularization. Our framework applies to numerous problems in machine learning and statistics; notably,...
ECAI
2006
Springer
15 years 2 months ago
2006
Springer
Minimally unsatisfiable subformulas (in short, MUSes) represent the smallest explanations for the inconsistency of SAT instances in terms of the number of involved clauses. Extract...