Sciweavers

8689 search results - page 36 / 1738
» Software: hard data
Sort
View
FOCS
2007
IEEE
15 years 6 months ago
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
Parikshit Gopalan, Subhash Khot, Rishi Saket
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 13 days ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
16 years 5 days ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
IPPS
2003
IEEE
15 years 5 months ago
SoCBUS: Switched Network on Chip for Hard Real Time Embedded Systems
With the current trend in integration of more complex systems on chip there is a need for better communication infrastructure on chip that will increase the available bandwidth an...
Daniel Wiklund, Dake Liu
JSA
2000
175views more  JSA 2000»
14 years 11 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd