Sciweavers

50 search results - page 6 / 10
» Construction of expanders and superconcentrators using Kolmo...
Sort
View
ECML
1997
Springer
13 years 11 months ago
Constructing Intermediate Concepts by Decomposition of Real Functions
In learning from examples it is often useful to expand an attribute-vector representation by intermediate concepts. The usual advantage of such structuring of the learning problemi...
Janez Demsar, Blaz Zupan, Marko Bohanec, Ivan Brat...
SDL
2001
73views Hardware» more  SDL 2001»
13 years 8 months ago
HyperMSCs with Connectors for Advanced Visual System Modelling and Testing
Experiences with the use of the MSC language for complex system specifications have shown that certain extensions are necessary in order to arrive at sufficiently transparent and m...
Jens Grabowski, Peter Graubmann, Ekkart Rudolph
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 7 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
13 years 9 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
GPCE
2004
Springer
14 years 25 days ago
Taming Macros
Scheme includes a simple yet powerful macro mechanism. Using macros, programmers can easily extend the language with new kinds of expressions and definitions, thus abstracting ove...
Ryan Culpepper, Matthias Felleisen