Results 1 - 10 of 606

Fast static analysis of C++ virtual function calls

by David F. Bacon, Peter F. Sweeney - In Proceedings OOPSLA '96, ACM SIGPLAN Notices , 1996
"... Virtual functions make code easier for programmers to reuse but also make it harder for compilers to analyze. We investi-gate the ability of three static analysis algorithms to improve C++ programs by resolving virtual function calls, thereby reducing compiled code size and reducing program complex- ..."
Abstract - Cited by 280 (10 self) - Add to MetaCart
Virtual functions make code easier for programmers to reuse but also make it harder for compilers to analyze. We investi-gate the ability of three static analysis algorithms to improve C++ programs by resolving virtual function calls, thereby reducing compiled code size and reducing program complex

Fast implementation and fair comparison of the final candidates for Advanced Encryption Standard using Field Programmable Gate Arrays

by Kris Gaj, Pawel Chodowiec , 2001
"... . The results of fast implementations of all five AES final candidates using Virtex Xilinx Field Programmable Gate Arrays are presented and analyzed. Performance of several alternative hardware architectures is discussed and compared. One architecture optimum from the point of view of the throug ..."
Abstract - Cited by 50 (9 self) - Add to MetaCart
. The results of fast implementations of all five AES final candidates using Virtex Xilinx Field Programmable Gate Arrays are presented and analyzed. Performance of several alternative hardware architectures is discussed and compared. One architecture optimum from the point of view

Timing Optimization of Logic Network Using Gate Duplication

by Chun-hong Chen, Chi-ying Tsui - In Proc. Asia and South Pacific Design Automation Conference , 1999
"... We present a timing optimization algorithm based on gate duplication. We first examine the relationship between gate duplication and delay reduction, and then introduce the notion of duplication gain for selecting the good candidate gates to be duplicated. The objective is to obtain the maximum dela ..."
Abstract - Cited by 10 (3 self) - Add to MetaCart
We present a timing optimization algorithm based on gate duplication. We first examine the relationship between gate duplication and delay reduction, and then introduce the notion of duplication gain for selecting the good candidate gates to be duplicated. The objective is to obtain the maximum

GADOLINIUM SCANDATE: NEXT CANDIDATE FOR ALTERNATIVE GATE DIELECTRIC IN CMOS TECHNOLOGY?

by Karol Fröhlich , Ján Fedor , * -Ivan Kostič , Ján Maňka , -Peter Ballo , 2011
"... The films of GdScO 3 were prepared by liquid injection metal-organic chemical vapor deposition, MOCVD at 600 • C on (100) Si substrate. The as-deposited films were amorphous with a smooth surface and sharp GdScO 3 /Si interface. X-ray diffraction showed that the amorphous phase is well preserved up ..."
Abstract - Add to MetaCart
candidate for alternative gate dielectric is discussed. EXPERIMENTAL METHODS The GdScO 3 films were deposited at 600 • C in a low-pressure hot-wall quartz reactor. The solution of Gd(thd) 3 and Sc(thd) 3 precursors dissolved in toluene in a concentration of 0.02 M was introduced using computer controlled

An FPGA Implementation and Performance Evaluation of the AES Block Cipher Candidate Algorithm Finalists

by AJ Elbirt, W Yip, B Chetwynd, C Paar , 1999
"... The technical analysis used in determining which of the Advanced Encryption Standard candidates will be selected as the Advanced Encryption Algorithm includes efficiency testing of both hardware and software implementations of candidate algorithms. Reprogrmmable devices such as Field Programmable ..."
Abstract - Cited by 65 (4 self) - Add to MetaCart
The technical analysis used in determining which of the Advanced Encryption Standard candidates will be selected as the Advanced Encryption Algorithm includes efficiency testing of both hardware and software implementations of candidate algorithms. Reprogrmmable devices such as Field Programmable

Computing Slater rankings using similarities among candidates

by Vincent Conitzer - In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI , 2006
"... Voting (or rank aggregation) is a general method for aggre-gating the preferences of multiple agents. One important vot-ing rule is the Slater rule. It selects a ranking of the alter-natives (or candidates) to minimize the number of pairs of candidates such that the ranking disagrees with the pairwi ..."
Abstract - Cited by 47 (7 self) - Add to MetaCart
Voting (or rank aggregation) is a general method for aggre-gating the preferences of multiple agents. One important vot-ing rule is the Slater rule. It selects a ranking of the alter-natives (or candidates) to minimize the number of pairs of candidates such that the ranking disagrees

An FPGA-Based Performance Evaluation of the AES Block Cipher Candidate Algorithm Finalists

by AJ Elbirt, W Yip, B Chetwynd, C Paar - IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS , 2001
"... The technical analysis used in determining which of the potential Advanced Encryption Standard candidates will be selected as the Advanced Encryption Algorithm includes efficiency testing of both hardware and software implementations of candidate algorithms. Reprogrammable devices such as Field P ..."
Abstract - Cited by 57 (8 self) - Add to MetaCart
The technical analysis used in determining which of the potential Advanced Encryption Standard candidates will be selected as the Advanced Encryption Algorithm includes efficiency testing of both hardware and software implementations of candidate algorithms. Reprogrammable devices such as Field

NL. A list of candidate cancer biomarkers for targeted proteomics. Biomark Insights

by Malu Polanski, Norman Leigh Anderson, See Profile, Malu Polanski, N. Leigh Anderson
"... All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract - Cited by 33 (1 self) - Add to MetaCart
All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.

An Integrative CGH, MSI and Candidate Genes

by Hadi Razjouyan, See Profile, Pooneh Mokaram, Alejandro A Schaffer, Hassan Ashktorab, Hassan Brim, Mones S. Abu-asab, Mehdi Nouraie, Jose Salazar, Jim Deleo, Hadi Razjouyan
"... SEE PROFILE All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract - Add to MetaCart
SEE PROFILE All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.

FAST TRACK COMMUNICATION Electron dynamics in quantum gate operation

by A Kerridge, A H Harker, A M Stoneham , 2007
"... We model the evolving time-dependent electronic structure of a solid-state quantum gate as it performs basic quantum operations. Our time-dependent configuration-interaction method follows the evolution of two donor electron spin qubits interacting with a third, optically excited, control spin in an ..."
Abstract - Add to MetaCart
and SWAP operations. From our evaluation of the accuracy of a set of candidate gates we estimate the residual entanglement of the control electron and overall gate operation times. These results attest to the feasibility of the silicon-based quantum gates proposed by Stoneham, Fisher and Greenland. Quantum
Results 1 - 10 of 606