Sciweavers

11063 search results - page 96 / 2213
» On the existence of universal models
Sort
View
JAC
2008
13 years 11 months ago
Amalgamation of cellular automata
In this paper, we study amalgamations of cellular automata (CA), i.e. ways of combining two CA by disjoint union. We show that for several families of CA obtained by simple amalgam...
Guillaume Theyssier
LATINCRYPT
2010
13 years 8 months ago
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yer...
ACSC
2007
IEEE
14 years 4 months ago
Domination Normal Form - Decomposing Relational Database Schemas
A common approach in designing relational databases is to start with a universal relation schema, which is then decomposed into multiple subschemas. A good choice of subschemas ca...
Henning Köhler
NIPS
2003
13 years 11 months ago
No Unbiased Estimator of the Variance of K-Fold Cross-Validation
Most machine learning researchers perform quantitative experiments to estimate generalization error and compare algorithm performances. In order to draw statistically convincing c...
Yoshua Bengio, Yves Grandvalet
NDJFL
2010
13 years 5 months ago
An Extension of van Lambalgen's Theorem to Infinitely Many Relative 1-Random Reals
Van Lambalgen's Theorem plays an important role in algorithmic randomness, especially when studying relative randomness. In this paper we extend van Lambalgen's Theorem ...
Kenshi Miyabe