Sciweavers

2767 search results - page 151 / 554
» Universal Exponentiation Algorithm
Sort
View
URBAN
2008
90views more  URBAN 2008»
14 years 10 months ago
The use of Web 2.0 concepts to support deliberation in spatial decision-making
Technologies associated with the second-generation of the World-Wide Web enable virtually anyone to share their data, documents, observations, and opinions on the Internet. In les...
Claus Rinner, Carsten Keßler, Stephen Andrul...
ENTCS
2002
114views more  ENTCS 2002»
14 years 10 months ago
Adjunction Models For Call-By-Push-Value With Stacks
Call-by-push-value is a "semantic machine code", providing a set of simple primitives from which both the call-by-value and call-by-name paradigms are built. We present i...
Paul Blain Levy
TIT
2002
78views more  TIT 2002»
14 years 9 months ago
Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding
Lossy compression of a discrete memoryless source (DMS) with respect to a single-letter distortion measure is considered. We study the best attainable tradeoff between the exponent...
Tsachy Weissman, Neri Merhav
TIT
2011
119views more  TIT 2011»
14 years 5 months ago
Redundancy-Related Bounds for Generalized Huffman Codes
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
Michael B. Baer
ICML
2009
IEEE
15 years 11 months ago
Herding dynamical weights to learn
A new "herding" algorithm is proposed which directly converts observed moments into a sequence of pseudo-samples. The pseudosamples respect the moment constraints and ma...
Max Welling