Sciweavers

513 search results - page 86 / 103
» Finitely Based, Finite Sets of Words
Sort
View
TIT
2008
164views more  TIT 2008»
13 years 7 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung
CSCLP
2008
Springer
13 years 9 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
CAL
2002
13 years 7 months ago
MinneSPEC: A New SPEC Benchmark Workload for Simulation-Based Computer Architecture Research
Abstract-- Computer architects must determine how to most effectively use finite computational resources when running simulations to evaluate new architectural ideas. To facilitate...
A. J. KleinOsowski, David J. Lilja
IISWC
2008
IEEE
14 years 1 months ago
A workload for evaluating deep packet inspection architectures
—High-speed content inspection of network traffic is an important new application area for programmable networking systems, and has recently led to several proposals for high-per...
Michela Becchi, Mark A. Franklin, Patrick Crowley
ROBIO
2006
IEEE
469views Robotics» more  ROBIO 2006»
14 years 1 months ago
FPGA-Implementation of Inverse Kinematics and Servo Controller for Robot Manipulator
- The implementation of inverse kinematics and servo controller for robot manipulator using FPGA (Field Programmer Gate Array) is investigated in this paper. Firstly, the mathemati...
Ying-Shieh Kung, Kuan-Hsuan Tseng, Chia-Sheng Chen...