Sciweavers

1931 search results - page 101 / 387
» Why we blog
Sort
View
DAGSTUHL
2006
13 years 11 months ago
The complexity of Boolean functions from cryptographic viewpoint
Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...
Claude Carlet
IADIS
2004
13 years 11 months ago
Erroneous Examples as a Source of Learning in Mathematics
We analyze why and how erroneous examples can be beneficially employed in learning mathematics. The `Why' addresses reasoning and attitudes that are rarely fostered in today&...
Erica Melis
PVLDB
2008
120views more  PVLDB 2008»
13 years 9 months ago
On the provenance of non-answers to queries over extracted data
In information extraction, uncertainty is ubiquitous. For this reason, it is useful to provide users querying extracted data with explanations for the answers they receive. Provid...
Jiansheng Huang, Ting Chen, AnHai Doan, Jeffrey F....
IACR
2011
113views more  IACR 2011»
12 years 9 months ago
KISS: A Bit Too Simple
KISS (‘Keep it Simple Stupid’) is an efficient pseudo-random number generator originally specified by G. Marsaglia and A. Zaman in 1993. G. Marsaglia in 1998 posted a C versio...
Greg Rose
ISPASS
2003
IEEE
14 years 3 months ago
A statistical model of skewed-associativity
This paper presents a statistical model for explaining why skewed-associativity removes conflicts better than setassociativity. We show that, with a high probability, 2-way skewe...
Pierre Michaud