Rusins Freivalds
Rusins Freivalds
Professor of Computer Science, University of Latvia
Verifierad e-postadress på mii.lu.lv
Titel
Citeras av
Citeras av
År
1-way quantum finite automata: strengths, weaknesses and generalizations
A Ambainis, R Freivalds
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998
3371998
Probabilistic Two-Way Machines
R Freivalds
MFCS, 1981
2061981
Fast probabilistic algorithms
R Freivalds
Mathematical Foundations of Computer Science 1979, 57-69, 1979
2051979
On the prediction of general recursive functions
JM Barzdins
Soviet Mathematics Doklady 13, 1224-1228, 1972
1991972
Probabilistic Machines Can Use Less Running Time.
R Freivalds
IFIP congress 839, 842, 1977
1931977
ON THE ROLE OF PROCRASTINATION IN MACHINE LEARNING
CHS Rusins Freivalds
INFORMATION AND COMPUTATION, 1993
1231993
On the role of procrastination for machine learning
CHS Rusins Freivalds
COLT, 1992
123*1992
Inductive inference with additional information
RV Freivald, R Wiehagen
Elektronische Informationsverarbeitung und Kybernetik 15 (4), 179-185, 1979
861979
Finite identification of general recursive functions by probabilistic strategies
R Freivalds
Proceedings of the Conference on Fundamentals of Computation Theory, 138-145, 1979
671979
On the power of probabilistic strategies in inductive inference
R Wiehagen, R Freivalds, EB Kinber
Theoretical Computer Science 28 (1-2), 111-133, 1983
661983
Inductive inference of recursive functions: Qualitative theory
R Freivalds
Lecture Notes in Computer Science 502, 77-110, 1991
641991
Minimal Gödel numbers and their identification in the limit
R Freivald
Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské …, 1975
631975
On the intrinsic complexity of learning
R Freivalds, E Kinber, C Smith
Computational Learning Theory, 154-168, 1995
611995
On the intrinsic complexity of learning
CHS Rusins Freivalds, Efim B. Kinber
INFORMATION AND COMPUTATION 123 (1), 64-71, 1995
61*1995
On the intrinsic complexity of learning
CHS Rusins Freivalds, Efim B. Kinber
COLT, 1995
61*1995
On the power of inductive inference from good examples
R Freivalds, EB Kinber, R Wiehagen
Theoretical Computer Science 110 (1), 131-144, 1993
581993
Lower Space Bounds for Randomized Computation
F Rusins
57*
Minimal nontrivial space complexity of probabilistic one-way Turing machines
J Kaņeps, R Freivalds
Mathematical Foundations of Computer Science 1990, 355-361, 1990
531990
Probabilities to accept languages by quantum finite automata
A Ambainis, R Bonner, R Freivalds, A Ķikusts
International Computing and Combinatorics Conference, 174-183, 1999
521999
Completeness criteria for partial functions of the algebra of logic and many-valued logics
RV Freivald
Dokl. Akad. Nauk. SSSR 167 (6), 1249-1250, 1966
481966
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20