Sciweavers

494 search results - page 63 / 99
» Heap Building Bounds
Sort
View
DCC
2002
IEEE
16 years 3 months ago
Source Requantization: Successive Degradation and Bit Stealing
We consider source requantization in two forms -- successive degradation (i.e., source fidelity reduction) and bit stealing (i.e., information embedding) -when no forward planning...
Aaron S. Cohen, Stark C. Draper, Emin Martinian, G...
118
Voted
TCC
2010
Springer
231views Cryptology» more  TCC 2010»
16 years 20 days ago
A Domain Extender for the Ideal Cipher
We describe the first domain extender for ideal ciphers, i.e. we show a construction that is indifferentiable from a 2n-bit ideal cipher, given a n-bit ideal cipher. Our construc...
Jean-Sébastien Coron, Yevgeniy Dodis, Avrad...
143
Voted
ARC
2009
Springer
188views Hardware» more  ARC 2009»
15 years 10 months ago
Word-Length Optimization and Error Analysis of a Multivariate Gaussian Random Number Generator
Abstract. Monte Carlo simulation is one of the most widely used techniques for computationally intensive simulations in mathematical analysis and modeling. A multivariate Gaussian ...
Chalermpol Saiprasert, Christos-Savvas Bouganis, G...
167
Voted
DEXA
2009
Springer
222views Database» more  DEXA 2009»
15 years 10 months ago
On Index-Free Similarity Search in Metric Spaces
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...
Tomás Skopal, Benjamin Bustos
SEMWEB
2009
Springer
15 years 10 months ago
Optimizing Web Service Composition While Enforcing Regulations
Abstract. To direct automated Web service composition, it is compelling to provide a template, workflow or scaffolding that dictates the ways in which services can be composed. I...
Shirin Sohrabi, Sheila A. McIlraith