Sciweavers

1576 search results - page 269 / 316
» Properties of Synthetic Optimization Problems
Sort
View
COMGEO
2007
ACM
13 years 10 months ago
On incremental rendering of silhouette maps of a polyhedral scene
We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can ...
Alon Efrat, Leonidas J. Guibas, Olaf A. Hall-Holt,...
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 10 months 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
FOCS
2007
IEEE
14 years 4 months ago
Non-Linear Index Coding Outperforming the Linear Optimum
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...
Eyal Lubetzky, Uri Stav
TACAS
2005
Springer
108views Algorithms» more  TACAS 2005»
14 years 3 months ago
On Some Transformation Invariants Under Retiming and Resynthesis
Transformations using retiming and resynthesis operations are the most important and practical (if not the only) techniques used in optimizing synchronous hardware systems. Althoug...
Jie-Hong Roland Jiang
IM
2007
13 years 11 months ago
Compass: Cost of Migration-aware Placement in Storage Systems
— We investigate methodologies for placement and migration of logical data stores in virtualized storage systems leading to optimum system configuration in a dynamic workload sc...
Akshat Verma, Upendra Sharma, Rohit Jain, Koustuv ...