Sciweavers

1194 search results - page 197 / 239
» Lectures on reconfigurable computing
Sort
View
SIAMCOMP
1998
118views more  SIAMCOMP 1998»
13 years 9 months ago
Genericity, Randomness, and Polynomial-Time Approximations
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
Yongge Wang
ISAAC
2003
Springer
91views Algorithms» more  ISAAC 2003»
14 years 3 months ago
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical ...
Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yama...
BIB
2006
169views more  BIB 2006»
13 years 10 months ago
Bio-ontologies: current trends and future directions
: In recent years, as a knowledge-based discipline, bioinformatics has moved to make its knowledge more computationally amenable. After its beginnings in the disciplines as a techn...
Olivier Bodenreider, Robert Stevens
FPGA
2006
ACM
90views FPGA» more  FPGA 2006»
14 years 1 months ago
Improving performance and robustness of domain-specific CPLDs
Many System-on-a-Chip devices would benefit from the inclusion of reprogrammable logic on the silicon die, as it can add general computing ability, provide run-time reconfigurabil...
Mark Holland, Scott Hauck

Lab
1058views
14 years 6 months ago
UP Electrical and Electronics Engineering Institute
The Institute's mission is to produce excellent, innovative and nationalistic engineers and to advance the field of electrical and electronics engineering. The undergr...