Sciweavers

40 search results - page 7 / 8
» How Far Can We Go on the x64 Processors
Sort
View
FOCS
1995
IEEE
13 years 11 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
FCCM
2006
IEEE
101views VLSI» more  FCCM 2006»
14 years 1 months ago
A Type Architecture for Hybrid Micro-Parallel Computers
Recently, platform FPGAs that integrate sequential processors with a spatial fabric have become prevalent. While these hybrid architectures ease the burden of integrating sequenti...
Benjamin Ylvisaker, Brian Van Essen, Carl Ebeling
HASKELL
2007
ACM
13 years 11 months ago
A type-preserving closure conversion in haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By type-checking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
OTM
2009
Springer
14 years 2 months ago
Heterogeneity and Context in Semantic-Web-Enabled HCLS Systems
The need for semantics preserving integration of complex data has been widely recognized in the healthcare domain. While standards such as Health Level Seven (HL7) have been develo...
Antoine Zimmermann, Ratnesh Sahay, Ronan Fox, Axel...
CORR
2007
Springer
123views Education» more  CORR 2007»
13 years 7 months ago
Channel Capacity Estimation using Free Probability Theory
—In many channel measurement applications, one needs to estimate some characteristics of the channels based on a limited set of measurements. This is mainly due to the highly tim...
Øyvind Ryan, Mérouane Debbah