Sciweavers

1778 search results - page 28 / 356
» On the Power of the Randomized Iterate
Sort
View
TCAD
1998
126views more  TCAD 1998»
15 years 5 months ago
Iterative remapping for logic circuits
Abstract—This paper presents an aggressive optimization technique targeting combinational logic circuits. Starting from an initial implementation mapped on a given technology lib...
Luca Benini, Patrick Vuillod, Giovanni De Micheli
ICCV
2007
IEEE
16 years 8 months ago
LogCut - Efficient Graph Cut Optimization for Markov Random Fields
Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...
Victor S. Lempitsky, Carsten Rother, Andrew Blake
ICASSP
2011
IEEE
14 years 9 months ago
EM-style optimization of hidden conditional random fields for grapheme-to-phoneme conversion
We have recently proposed an EM-style algorithm to optimize log-linear models with hidden variables. In this paper, we use this algorithm to optimize a hidden conditional random ï...
Georg Heigold, Stefan Hahn, Patrick Lehnen, Herman...
IPPS
2009
IEEE
16 years 19 days ago
Dynamic iterations for the solution of ordinary differential equations on multicore processors
In the past few years, there has been a trend of providing increased computing power through greater number of cores on a chip, rather than through higher clock speeds. In order t...
Yanan Yu, Ashok Srinivasan
VTC
2006
IEEE
15 years 12 months ago
An Iterative Detection Technique for DS-CDMA Signals with Strong Nonlinear Distortion Effects
Abstract - Whenever a DS-CDMA signal (Direct Sequence Code Division Multiple Access) is the sum of several components associated to different spreading codes (e.g., the DS-CDMA sig...
Rui Dinis, Paulo Silva