Sciweavers

530 search results - page 80 / 106
» Universal randomized switching
Sort
View
SAT
2010
Springer
172views Hardware» more  SAT 2010»
15 years 9 days ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
CAIP
2009
Springer
202views Image Analysis» more  CAIP 2009»
14 years 11 months ago
Near-Regular Texture Synthesis
This paper describes a method for seamless enlargement or editing of difficult colour textures containing simultaneously both regular periodic and stochastic components. Such textu...
Michal Haindl, Martin Hatka
NAACL
2003
15 years 3 months ago
Implicit Trajectory Modeling through Gaussian Transition Models for Speech Recognition
It is well known that frame independence assumption is a fundamental limitation of current HMM based speech recognition systems. By treating each speech frame independently, HMMs ...
Hua Yu, Tanja Schultz
TIT
2002
95views more  TIT 2002»
15 years 1 months ago
On sequential strategies for loss functions with memory
The problem of optimal sequential decision for individual sequences, relative to a class of competing o -line reference strategies, is studied for general loss functions with memo...
Neri Merhav, Erik Ordentlich, Gadiel Seroussi, Mar...
ICCAD
2009
IEEE
87views Hardware» more  ICCAD 2009»
14 years 11 months ago
Mitigation of intra-array SRAM variability using adaptive voltage architecture
SRAM cell design is driven by the need to satisfy static noise margin, write margin and read current margin (RCM) over all cells in the array in an energy-efficient manner. These ...
Ashish Kumar Singh, Ku He, Constantine Caramanis, ...