Sciweavers

40 search results - page 3 / 8
» Efficient application migration under compiler guidance
Sort
View
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
13 years 9 months ago
Efficient Arguments without Short PCPs
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
CVPR
2007
IEEE
14 years 7 months ago
A Bio-inspired Learning Approach for the Classification of Risk Zones in a Smart Space
Learning from experience is a basic task of human brain that is not yet fulfilled satisfactorily by computers. Therefore, in recent years to cope with this issue, bio-inspired app...
Alessio Dore, Matteo Pinasco, Carlo S. Regazzoni
IJPP
2010
156views more  IJPP 2010»
13 years 2 months ago
ForestGOMP: An Efficient OpenMP Environment for NUMA Architectures
Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-uniform ar...
François Broquedis, Nathalie Furmento, Bric...
DAC
2004
ACM
14 years 6 months ago
Dynamic FPGA routing for just-in-time FPGA compilation
Just-in-time (JIT) compilation has previously been used in many applications to enable standard software binaries to execute on different underlying processor architectures. Howev...
Roman L. Lysecky, Frank Vahid, Sheldon X.-D. Tan
FCCM
2005
IEEE
139views VLSI» more  FCCM 2005»
13 years 11 months ago
A Study of the Scalability of On-Chip Routing for Just-in-Time FPGA Compilation
Just-in-time (JIT) compilation has been used in many applications to enable standard software binaries to execute on different underlying processor architectures. We previously in...
Roman L. Lysecky, Frank Vahid, Sheldon X.-D. Tan