Sciweavers

6568 search results - page 295 / 1314
» Reducing the Complexity of Reductions
Sort
View
COCO
1998
Springer
100views Algorithms» more  COCO 1998»
15 years 11 months ago
Uniformly Hard Languages
Ladner [18] showed that there are no minimal recursive sets under polynomial-time reductions. Given any recursive set A, Ladner constructs a set B such that B strictly reduces to ...
Rodney G. Downey, Lance Fortnow
VLSID
2010
IEEE
168views VLSI» more  VLSID 2010»
15 years 10 months ago
A New Hetero-material Stepped Gate (HSG) SOI LDMOS for RF Power Amplifier Applications
In this paper, we propose a new hetero-material stepped gate (HSG) SOI LDMOS in which the gate is divided into three sections - an n+ gate sandwiched between two p+ gates and the ...
Radhakrishnan Sithanandam, Mamidala Jagadesh Kumar
FPL
2008
Springer
104views Hardware» more  FPL 2008»
15 years 8 months ago
A technique for minimizing power during FPGA placement
This paper considers the implementation of an annealing technique for dynamic power reduction in FPGAs. The proposed method comprises a power-aware objective function for placemen...
Kristofer Vorwerk, Madhu Raman, Julien Dunoyer, Ya...
NIPS
2004
15 years 8 months ago
Multiple Relational Embedding
We describe a way of using multiple different types of similarity relationship to learn a low-dimensional embedding of a dataset. Our method chooses different, possibly overlappin...
Roland Memisevic, Geoffrey E. Hinton
TCAD
2008
107views more  TCAD 2008»
15 years 6 months ago
Power Grid Analysis and Optimization Using Algebraic Multigrid
Abstract--This paper presents a class of power grid analysis and optimization techniques, all of which are based on the algebraic-multigrid (AMG) method. First, a new AMG-based red...
Cheng Zhuo, Jiang Hu, Min Zhao, Kangsheng Chen