Sciweavers

598 search results - page 77 / 120
» Predicting Lattice Reduction
Sort
View
CSREAESA
2004
15 years 5 months ago
A High Performance, Low Area Overhead Carry Lookahead Adder
Adders are some of the most critical data path circuits requiring considerable design effort in order to "squeeze" out as much performance gain as possible. Many adder d...
James Levy, Jabulani Nyathi
DAC
2011
ACM
14 years 3 months ago
AENEID: a generic lithography-friendly detailed router based on post-RET data learning and hotspot detection
In the era of deep sub-wavelength lithography for nanometer VLSI designs, manufacturability and yield issues are critical and need to be addressed during the key physical design i...
Duo Ding, Jhih-Rong Gao, Kun Yuan, David Z. Pan
KDD
2007
ACM
167views Data Mining» more  KDD 2007»
16 years 4 months ago
Generalized component analysis for text with heterogeneous attributes
We present a class of richly structured, undirected hidden variable models suitable for simultaneously modeling text along with other attributes encoded in different modalities. O...
Xuerui Wang, Chris Pal, Andrew McCallum
154
Voted
CODES
2007
IEEE
15 years 10 months ago
Compile-time decided instruction cache locking using worst-case execution paths
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access results in a definite cache hit or miss. This unpredictability i...
Heiko Falk, Sascha Plazar, Henrik Theiling
SIAMSC
2011
142views more  SIAMSC 2011»
14 years 10 months ago
Efficiency Based Adaptive Local Refinement for First-Order System Least-Squares Formulations
Abstract. In this paper, we propose new adaptive local refinement (ALR) strategies for firstorder system least-squares (FOSLS) finite element in conjunction with algebraic multi...
J. H. Adler, Thomas A. Manteuffel, Stephen F. McCo...