Sciweavers

3568 search results - page 664 / 714
» Type Analysis for JavaScript
Sort
View
ESOP
2005
Springer
14 years 2 months ago
Programming with Explicit Security Policies
Are computing systems trustworthy? To answer this, we need to know three things: what the systems are supposed to do, what they are not supposed to do, and what they actually do. A...
Andrew C. Myers
FPGA
2005
ACM
195views FPGA» more  FPGA 2005»
14 years 2 months ago
Sparse Matrix-Vector multiplication on FPGAs
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering applications. The poor data locality of sparse matrices sig...
Ling Zhuo, Viktor K. Prasanna
GFKL
2005
Springer
167views Data Mining» more  GFKL 2005»
14 years 2 months ago
Quantitative Text Typology: The Impact of Sentence Length
Abstract. This study focuses on the contribution of sentence length for a quantitative text typology. Therefore, 333 Slovenian texts are analyzed with regard to their sentence leng...
Emmerich Kelih, Peter Grzybek, Gordana Antic, Erns...
RTA
2005
Springer
14 years 2 months ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner
STACS
2005
Springer
14 years 2 months ago
Algorithmics in Exponential Time
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
Uwe Schöning