Results 1  10
of
337,525
Simple Recursive Games
"... Abstract. We define the class of simple recursive games. A simple recursive game is defined as a simple stochastic game (a notion due to Anne Condon), except that we allow arbitrary real payoffs but disallow moves of chance. We study the complexity of solving simple recursive games and obtain an alm ..."
Abstract
 Add to MetaCart
Abstract. We define the class of simple recursive games. A simple recursive game is defined as a simple stochastic game (a notion due to Anne Condon), except that we allow arbitrary real payoffs but disallow moves of chance. We study the complexity of solving simple recursive games and obtain
A Simple Recursive Tessellator
, 2000
"... Sometimes there's a need to create a triangular mesh approximation of a parametric surface. If the parameterization is nonuniform (compressed in some areas, stretchy in others), a uniform grid in the domain becomes distorted and provides a bad approximation. We describe how to create an ad ..."
Abstract
 Add to MetaCart
at enough, or requires further subdivision. Our contribution is a simple algorithm for guaranteeing the topology of the resulting mesh is \nice," in the sense that there are no cracks between triangles (i.e., Tjunctions), and for ensuring that subdivision stops at some scale. 1 Background
A simple recursive forecasting model
 Economics Letters
, 2006
"... We compare the performance of alternative recursive forecasting models. A simple constant gain algorithm, used widely in the learning literature, both forecasts well out of sample and also provides the best fit to the Survey of Professional Forecasters. ..."
Abstract

Cited by 27 (5 self)
 Add to MetaCart
We compare the performance of alternative recursive forecasting models. A simple constant gain algorithm, used widely in the learning literature, both forecasts well out of sample and also provides the best fit to the Survey of Professional Forecasters.
A Simple Recursive Forecasting Model
, 2005
"... compare the performance of alternative recursive forecasting models. A simple ..."
Abstract
 Add to MetaCart
compare the performance of alternative recursive forecasting models. A simple
A Transformation System for Developing Recursive Programs
, 1977
"... A system of rules for transforming programs is described, with the programs in the form of recursion equations An initially very simple, lucid. and hopefully correct program IS transformed into a more efficient one by altering the recursion structure Illustrative examples of program transformations ..."
Abstract

Cited by 647 (3 self)
 Add to MetaCart
A system of rules for transforming programs is described, with the programs in the form of recursion equations An initially very simple, lucid. and hopefully correct program IS transformed into a more efficient one by altering the recursion structure Illustrative examples of program transformations
Verification of Simple Recursive Programs in Theorema: Completeness of the Method
, 2005
"... We report work concerning the theoretical basis and the implementation in the Theorema system of a methodology for the generation of verification conditions for recursive procedures, with the aim of practical verification of recursive programs. We develop a method for proving total correctness prope ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
properties of programs which have simple functional recursive definitions, and we discuss its different aspects. We also define a class of programs for which the method is complete and we give a detailed proof of the completeness statement.
Simple recursive implementation of fast multipole method
"... In this paper we present an implementation of the well known “fast multipole” method for the efficient calculation of dipole fields, that uses polynomials in the Cartesian coordinates rather than spherical harmonics. This has considerable efficiency and simplicity advantages. We have implemented it ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
it in the context of an arbitrary hierarchical system of cells – no periodic mesh is required. The implementation is in terms of recursive functions. Results are given for application to micromagnetic simulation. Key words: fast multipole method PACS: 07.05Tp, 75.40.Mg, 65C20 1
Learning Simple Recursive Concepts by Discovering Missing Examples
"... Here we introduce a system, SmartPlus, which learns recursive concepts from a small incomplete training set the members of which all lie on nonintersecting resolution path with respect to the target recursive theory and involve different constants. Unlike recent approaches to this learning problem ..."
Abstract
 Add to MetaCart
Here we introduce a system, SmartPlus, which learns recursive concepts from a small incomplete training set the members of which all lie on nonintersecting resolution path with respect to the target recursive theory and involve different constants. Unlike recent approaches to this learning
A Simple Recursive Tree Oblivious RAM
, 2014
"... Oblivious RAM (ORAM) has received increasing attention in the past few years. The goal of oblivious RAM is to enable a client, that can locally store only a small (preferably constant) amount of data, to store remotely N data items, and access them while hiding the identities of the items that are ..."
Abstract
 Add to MetaCart
Oblivious RAM (ORAM) has received increasing attention in the past few years. The goal of oblivious RAM is to enable a client, that can locally store only a small (preferably constant) amount of data, to store remotely N data items, and access them while hiding the identities of the items that are being accessed. Most of the earlier ORAM constructions were based on the hierarchical data structure of Goldreich and Ostrovsky [3]. Shi et al. [9] introduced a binary tree ORAM, which is simpler and more efficient than the classical hierarchical ORAM. Gentry et al. [2] have followed them and improved the scheme. In this work, we improve these two constructions. Our scheme asymptotically outperforms all previous tree based ORAM schemes that have constant client memory, with an overhead of O(log2+N log2 logN) per operation for a O(N) storage server. Although the best known asymptotic result for ORAM is due to the hierarchical structure of Kushilevitz et al. [6] (O ( log 2N log logN)), tree based ORAM constructions are much simpler.
Results 1  10
of
337,525