Sciweavers

85 search results - page 4 / 17
» Combinatorial algorithms for fast clock mesh optimization
Sort
View
ICCAD
2007
IEEE
115views Hardware» more  ICCAD 2007»
14 years 4 months ago
Timing optimization by restructuring long combinatorial paths
—We present an implementation of an algorithm for constructing provably fast circuits for a class of Boolean functions with input signals that have individual starting times. We ...
Jürgen Werber, Dieter Rautenbach, Christian S...
ICCAD
1993
IEEE
134views Hardware» more  ICCAD 1993»
13 years 12 months ago
Beyond the combinatorial limit in depth minimization for LUT-based FPGA designs
In this paper, we present an integrated approach to synthesis and mapping to go beyond the combinatorial limit set up by the depth-optimal FlowMap algorithm. The new algorithm, na...
Jason Cong, Yuzheng Ding
IBIS
2006
109views more  IBIS 2006»
13 years 7 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...
CGF
2010
218views more  CGF 2010»
13 years 7 months ago
Mesh Snapping: Robust Interactive Mesh Cutting Using Fast Geodesic Curvature Flow
This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...
Juyong Zhang, Chunlin Wu, Jianfei Cai, Jianmin Zhe...
ICASSP
2011
IEEE
12 years 11 months ago
A reweighted least squares algorithm for detection of QAM signaling in MIMO channels
This paper proposes a reweighted least squares algorithm for quadrature amplitude modulation (QAM) detector in multiple-input multiple-output (MIMO) channels. Although the QAM det...
Katsumi Konishi, Toshihiro Furukawa