MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Rusins Freivalds" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 15 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Kolmogorov numberings and minimal identification  
  • by Rusins Freivalds, Sanjay Jain — 1995 — Proc. 2nd European Conference on Computational Learning Theory, Lecture
  • …Identification of programs for computable functions from their graphs by algorithmic devices is a well studied problem in learning theory. Freivalds and Chen consider identification of ‘minimal ’ and ‘nearly minimal ’ programs for functions from their graphs. To address certain problems in minimal i…
  • Cited by 4 (1 self) – Add To MetaCart
  • Transformations That Preserve Learnability  
  • by Andris Ambainis, Rusins Freivalds — 1996 — Algorithmic Learning Theory: Seventh International Workshop (ALT ’96), volume 1160 of Lecture Notes in Artificial Intelligence
  • …. We consider transformations (performed by general recursive operators) mapping recursive functions into recursive functions. These transformations can be considered as mapping sets of recursive functions into sets of recursive functions. A transformation is said to be preserving the identicati…
  • Cited by 5 (0 self) – Add To MetaCart
  • Quantum Finite State Transducers  
  • by Rusins Freivalds, Andreas Winter — 2000 — Lect. Notes Comp. Sci
  • …We introduce quantum finite state transducers (qfst), and study the class of relations which they compute. It turns out that they share many features with probabilistic finite state transducers, especially regarding undecidability of emptiness (at least for low probability of success). However, like…
  • Cited by 1 (0 self) – Add To MetaCart
  • Lower Space Bounds for Randomized Computation  
  • by Rusins Freivalds, Marek Karpinski — 1994
  • …It is a fundamental open problem in the randomized computation how to separate different randomized time or randomized small space classes (cf., e.g., [KV 87], [KV 88]). In this paper we study lower space bounds for randomized computation, and prove lower space bounds up to log n for the specific se…
  • Cited by 8 (0 self) – Add To MetaCart
  • Co--Learning of Recursive Languages from Positive Data  
  • by Rusins Freivalds, Thomas Zeugmann — 1995 — RIFIS-TR-CS-110, RIFIS, Kyushu University 33
  • …The present paper deals with the co-learnability of enumerable families L of uniformly recursive languages from positive data. This refers to the following scenario. A family L of target languages as well as hypothesis space for it are specified. The co-learner is fed eventually all positive example…
  • Cited by 1 (1 self) – Add To MetaCart
  • On the Intrinsic Complexity of Learning  
  • by Rusins Freivalds, Efim Kinber, Carl H. Smith — 1995 — Information and Computation
  • …A new view of learning is presented. The basis of this view is a natural notion of reduction. We prove completeness and relative difficulty results. An infinite hierarchy of intrinsically more and more difficult to learn concepts is presented. Our results indicate that the complexity notion capt…
  • Cited by 20 (6 self) – Add To MetaCart
  • Choosing a Learning Team: a Topological Approach  
  • by Kalvis Apsitis, Rusins Freivalds, Carl H. Smith — 1994 — in the Proceedings of the Conference \Operator Algebras and Mathematical Physics", Constantza 2001
  • …this paper we address the issue of how to compose teams. While this endeavor may sound like it belongs in the realm of psychology, it turns out that there are some interesting things that can be formally proved us- This work was facilitated by an international agreement under NSF Grant 9119540.…
  • Cited by 3 (1 self) – Add To MetaCart
  • On the Impact of Forgetting on Learning Machines  
  • by Rusins Freivalds, Efim Kinber, Carl H. Smith — 1993 — Journal of the ACM
  • …this paper contributes toward the goal of understanding how a computer can be programmed to learn by isolating features of incremental learning algorithms that theoretically enhance their learning potential. In particular, we examine the effects of imposing a limit on the amount of information that …
  • Cited by 10 (3 self) – Add To MetaCart
  • On Duality in Learning and the Selection of Learning Teams  
  • by Kalvis Apsitis, Rusins Freivalds, Carl H. Smith — 1996 — Information and Computation
  • …Previous work in inductive inference dealt mostly with finding one or several machines (IIMs) that successfully learn a collection of functions. Herein we start with a class of functions and consider the learner set of all IIMs that are successful at learning the given class. Applying this perspe…
  • Cited by 3 (2 self) – Add To MetaCart
  • Inductive Inference with Procrastination: Back to Definitions  
  • by Andris Ambainis, Rusins Freivalds, Carl H. Smith — 1999 — Fundamenta Informaticae
  • …In this paper, we reconsider the denition of procrastinating learning machines. In the original denition of Freivalds and Smith [FS93], constructive ordinals are used to bound mindchanges. We investigate possibility of using arbitrary linearly ordered sets to bound mindchanges in similar way. It…
  • Cited by 8 (2 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB