Sciweavers

2060 search results - page 177 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
SIGSOFT
2006
ACM
15 years 4 months ago
Interpolation for data structures
Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to contr...
Deepak Kapur, Rupak Majumdar, Calogero G. Zarba
ICCAD
2004
IEEE
121views Hardware» more  ICCAD 2004»
15 years 7 months ago
Factoring and eliminating common subexpressions in polynomial expressions
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
Anup Hosangadi, Farzan Fallah, Ryan Kastner
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
14 years 4 months ago
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
HPCA
2006
IEEE
15 years 10 months ago
An approach for implementing efficient superscalar CISC processors
An integrated, hardware / software co-designed CISC processor is proposed and analyzed. The objectives are high performance and reduced complexity. Although the x86 ISA is targete...
Shiliang Hu, Ilhyun Kim, Mikko H. Lipasti, James E...
SPAA
2004
ACM
15 years 3 months ago
Online algorithms for network design
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
Adam Meyerson