Sciweavers

1403 search results - page 42 / 281
» About Approximations of Exponentials
Sort
View
ICML
2007
IEEE
15 years 12 months ago
Winnowing subspaces
We generalize the Winnow algorithm for learning disjunctions to learning subspaces of low rank. Subspaces are represented by symmetric projection matrices. The online algorithm ma...
Manfred K. Warmuth
ACAL
2007
Springer
15 years 5 months ago
Structural Circuits and Attractors in Kauffman Networks
There has been some ambiguity about the growth of attractors in Kauffman networks with network size. Some recent work has linked this to the role and growth of circuits or loops o...
Kenneth A. Hawick, Heath A. James, Chris Scogings
FCCM
1998
IEEE
99views VLSI» more  FCCM 1998»
15 years 3 months ago
FPGA-Based Architecture Evaluation of Cryptographic Coprocessors for Smartcards
In 1996, about 600 million IC-cards were manufactured worldwide. Due to very small die sizes (max. 25 mm2 ) smartcards encounter more severe restrictions than conventional coproces...
Hagen Ploog, Dirk Timmermann
SYNTHESE
2008
114views more  SYNTHESE 2008»
14 years 11 months ago
Quantified coalition logic
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
60
Voted
MOC
2002
70views more  MOC 2002»
14 years 10 months ago
Positivity preserving finite element approximation
We consider finite element operators defined on "rough" functions in a bounded polyhedron in RN . Insisting on preserving positivity in the approximations, we discover a...
Ricardo H. Nochetto, Lars B. Wahlbin