Sciweavers

692 search results - page 52 / 139
» BDD minimization for approximate computing
Sort
View
88
Voted
VLSID
2004
IEEE
111views VLSI» more  VLSID 2004»
15 years 11 months ago
On Buffering Schemes for Long Multi-Layer Nets
We consider the problem of minimizing the delay in signal transmission over point-to-point connections across multiple metal layers in a VLSI circuit. We present an exact solution...
Vani Prasad, Madhav P. Desai
103
Voted
UAI
2008
15 years 9 days ago
Bounds on the Bethe Free Energy for Gaussian Networks
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. As an extension of Welling and ...
Botond Cseke, Tom Heskes
MOR
2006
95views more  MOR 2006»
14 years 10 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
SAC
2006
ACM
15 years 4 months ago
Building the functional performance model of a processor
In this paper, we present an efficient procedure for building a piecewise linear function approximation of the speed function of a processor with hierarchical memory structure. Th...
Alexey L. Lastovetsky, Ravi Reddy, Robert Higgins
80
Voted
ECCV
2008
Springer
16 years 23 days ago
Learning for Optical Flow Using Stochastic Optimization
Abstract. We present a technique for learning the parameters of a continuousstate Markov random field (MRF) model of optical flow, by minimizing the training loss for a set of grou...
Yunpeng Li, Daniel P. Huttenlocher