Sciweavers

97 search results - page 15 / 20
» Making the use of maximal ideals constructive
Sort
View
DCC
2010
IEEE
13 years 11 months ago
A Fast Compact Prefix Encoding for Pattern Matching in Limited Resources Devices
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
S. Harrusi, Amir Averbuch, N. Rabin
APLAS
2006
ACM
14 years 1 months ago
Scheme with Classes, Mixins, and Traits
Abstract. The Scheme language report advocates language design as the composition of a small set of orthogonal constructs, instead of a large accumulation of features. In this pape...
Matthew Flatt, Robert Bruce Findler, Matthias Fell...
SIGGRAPH
1997
ACM
13 years 11 months ago
Metropolis light transport
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
Eric Veach, Leonidas J. Guibas
PODS
2008
ACM
221views Database» more  PODS 2008»
14 years 7 months ago
A generic flow algorithm for shared filter ordering problems
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
TCC
2010
Springer
163views Cryptology» more  TCC 2010»
14 years 2 months ago
Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...
Benoît Libert, Moti Yung