7796 search results - page 17 / 1560 » On Generalized Schur Numbers |
117
click to vote
SIAMJO
2011
14 years 7 months ago
2011
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...
92
Voted
DCC
2007
IEEE
16 years 10 days ago
2007
IEEE
We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of ...
95
Voted
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
General trust management model that we present is adapted for ad-hoc coalition environment, rather than for classic client-supplier relationship. The trust representation used in ...
100
Voted
DAC
2010
ACM
15 years 4 months ago
2010
ACM
Reversible logic became a promising alternative to traditional circuits because of its applications e.g. in low-power design and quantum computation. As a result, design of revers...
113
Voted
FPGA
2008
ACM
15 years 2 months ago
2008
ACM
This paper introduces a method of constructing random number generators from four of the basic primitives provided by FPGAs: Flip-Flips, Lookup-Tables, Shift Registers, and RAMs. ...