Sciweavers

363 search results - page 13 / 73
» Code Generation for Polynomial Multiplication
Sort
View
APPROX
2005
Springer
84views Algorithms» more  APPROX 2005»
14 years 1 months ago
The Tensor Product of Two Codes Is Not Necessarily Robustly Testable
There has been significant interest lately in the task of constructing codes that are testable with a small number of random probes. Ben-Sasson and Sudan show that the repeated te...
Paul Valiant
PLDI
1998
ACM
13 years 12 months ago
Run-time Code Generation and Modal-ML
This paper presents a typed programming language and compiler for run-time code generation. The language, called ML2, extends ML with modal operators in the style of the Mini-ML2 ...
Philip Wickline, Peter Lee, Frank Pfenning
HPCA
2001
IEEE
14 years 8 months ago
CARS: A New Code Generation Framework for Clustered ILP Processors
Clustered ILP processors are characterized by a large number of non-centralized on-chip resources grouped into clusters. Traditional code generation schemes for these processors c...
Krishnan Kailas, Kemal Ebcioglu, Ashok K. Agrawala
WEA
2010
Springer
284views Algorithms» more  WEA 2010»
14 years 2 months ago
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002
PTS
2010
134views Hardware» more  PTS 2010»
13 years 6 months ago
A Learning-Based Approach to Unit Testing of Numerical Software
We present an application of learning-based testing to the problem of automated test case generation (ATCG) for numerical software. Our approach uses n-dimensional polynomial model...
Karl Meinke, Fei Niu