Sciweavers

1688 search results - page 54 / 338
» Implementing Optimizations at Decode Time
Sort
View
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 8 months ago
Explicit capacity-achieving list-decodable codes
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
Venkatesan Guruswami, Atri Rudra
IPPS
1998
IEEE
14 years 7 days ago
Predicting the Running Times of Parallel Programs by Simulation
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
Radu Rugina, Klaus E. Schauser
DATE
2010
IEEE
157views Hardware» more  DATE 2010»
14 years 1 months ago
RMOT: Recursion in model order for task execution time estimation in a software pipeline
Abstract—This paper addresses the problem of execution time estimation for tasks in a software pipeline independent of the application structure or the underlying architecture. A...
Nabeel Iqbal, M. A. Siddique, Jörg Henkel
RTAS
2008
IEEE
14 years 2 months ago
Using Trace Scratchpads to Reduce Execution Times in Predictable Real-Time Architectures
Instruction scratchpads have been previously suggested as a way to reduce the worst case execution time (WCET) of hard real-time programs without introducing the analysis issues p...
Jack Whitham, Neil C. Audsley
SIGMOD
1996
ACM
131views Database» more  SIGMOD 1996»
14 years 4 days ago
Materialized View Maintenance and Integrity Constraint Checking: Trading Space for Time
We investigate the problem of incremental maintenance of an SQL view in the face of database updates, and show that it is possible to reduce the total time cost of view maintenanc...
Kenneth A. Ross, Divesh Srivastava, S. Sudarshan