Sciweavers

1182 search results - page 156 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
ASPDAC
2009
ACM
144views Hardware» more  ASPDAC 2009»
15 years 7 months ago
Complete-k-distinguishability for retiming and resynthesis equivalence checking without restricting synthesis
Iterative retiming and resynthesis is a powerful way to optimize sequential circuits but its massive adoption has been hampered by the hardness of verification. This paper tackle...
Nikolaos D. Liveris, Hai Zhou, Prithviraj Banerjee
132
Voted
IFIP7
2001
Springer
137views Optimization» more  IFIP7 2001»
15 years 7 months ago
Data Mining via Support Vector Machines
Support vector machines (SVMs) have played a key role in broad classes of problems arising in various fields. Much more recently, SVMs have become the tool of choice for problems...
Olvi L. Mangasarian
ASPDAC
2005
ACM
92views Hardware» more  ASPDAC 2005»
15 years 4 months ago
An LP-based methodology for improved timing-driven placement
— A method for timing driven placement is presented. The core of the approach is optimal timing-driven relaxed placement based on a linear programming (LP) formulation. The formu...
Qingzhou (Ben) Wang, John Lillis, Shubhankar Sanya...
124
Voted
AUTOMATICA
2010
104views more  AUTOMATICA 2010»
15 years 2 months ago
Identification for robust H2 deconvolution filtering
This paper addresses robust deconvolution filtering when the system and noise dynamics are obtained by parametric system identification. Consistent with standard identification me...
Xavier Bombois, Håkan Hjalmarsson, Gé...
ICIP
2010
IEEE
14 years 12 months ago
Morphological wavelet transform with adaptive dyadic structures
We propose a two component method for denoising multidimensional signals, e.g. images. The first component uses a dynamic programing algorithm of complexity O(N log N) to find an ...
Zhen James Xiang, Peter J. Ramadge