Results 1  10
of
1,060
Unifying structured recursion schemes
 in International Conference on Functional Programming. ACM
"... Folds over inductive datatypes are well understood and widely used. In their plain form, they are quite restricted; but many disparate generalisations have been proposed that enjoy similar calculational benefits. There have also been attempts to unify the various generalisations: two prominent su ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
such unifications are the ‘recursion schemes from comonads ’ of Uustalu, Vene and Pardo, and our own ‘adjoint folds’. Until now, these two unified schemes have appeared incompatible. We show that this appearance is illusory: in fact, adjoint folds subsume recursion schemes from comonads. The proof of this claim
Efficient implementation of a BDD package
 In Proceedings of the 27th ACM/IEEE conference on Design autamation
, 1991
"... Efficient manipulation of Boolean functions is an important component of many computeraided design tasks. This paper describes a package for manipulating Boolean functions based on the reduced, ordered, binary decision diagram (ROBDD) representation. The package is based on an efficient implementat ..."
Abstract

Cited by 504 (9 self)
 Add to MetaCart
implementation of the ifthenelse (ITE) operator. A hash table is used to maintain a strong carwnical form in the ROBDD, and memory use is improved by merging the hash table and the ROBDD into a hybrid data structure. A memory funcfion for the recursive ITE algorithm is implemented using a hashbased cache
Nested Linear/Lattice Codes for Structured Multiterminal Binning
, 2002
"... Network information theory promises high gains over simple pointtopoint communication techniques, at the cost of higher complexity. However, lack of structured coding schemes limited the practical application of these concepts so far. One of the basic elements of a network code is the binning sch ..."
Abstract

Cited by 345 (14 self)
 Add to MetaCart
Network information theory promises high gains over simple pointtopoint communication techniques, at the cost of higher complexity. However, lack of structured coding schemes limited the practical application of these concepts so far. One of the basic elements of a network code is the binning
Partial parsing via finitestate cascades
 Natural Language Engineering
, 1996
"... Finitestate cascades represent an attractive architecture for parsing unrestricted text. Deterministic parsers specified by finitestate cascades are fast and reliable. They can be extended at modest cost to construct parse trees with finite feature structures. Finally, such deterministic parsers d ..."
Abstract

Cited by 340 (4 self)
 Add to MetaCart
Finitestate cascades represent an attractive architecture for parsing unrestricted text. Deterministic parsers specified by finitestate cascades are fast and reliable. They can be extended at modest cost to construct parse trees with finite feature structures. Finally, such deterministic parsers
CompilerBased Prefetching for Recursive Data Structures
 In Proceedings of the Seventh International Conference on Architectural Support for Programming Languages and Operating Systems
, 1996
"... Softwarecontrolled data prefetching offers the potential for bridging the everincreasing speed gap between the memory subsystem and today's highperformance processors. While prefetching has enjoyed considerable success in arraybased numeric codes, its potential in pointerbased applications ..."
Abstract

Cited by 203 (14 self)
 Add to MetaCart
based applications has remained largely unexplored. This paper investigates compilerbased prefetching for pointerbased applicationsin particular, those containing recursive data structures. We identify the fundamental problem in prefetching pointerbased data structures and propose a guideline for devising
Unifying Recursion Schemes
 SUBMITTED TO ICFP’13
, 2013
"... Folds over inductive datatypes are well understood and widely used. In their plain form, they are quite restricted; but many disparate generalisations have been proposed that enjoy similar calculational benefits. There have also been attempts to unify the various generalisations: two prominent such ..."
Abstract
 Add to MetaCart
such unifications are the ‘recursion schemes from comonads ’ of Uustalu, Vene and Pardo, and our own ‘adjoint folds’. Until now, these two unified schemes have appeared incompatible. We show that this appearance is illusory: in fact, adjoint folds subsume recursion schemes from comonads. The proof of this claim
Unbiased recursive partitioning: a conditional inference framework
, 2004
"... Recursive binary partitioning is a popular tool for regression analysis. Two fundamental problems of exhaustive search procedures usually applied to fit such models have been known for a long time: Overfitting and a selection bias towards covariates with many possible splits or missing values. While ..."
Abstract

Cited by 165 (12 self)
 Add to MetaCart
unified framework for recursive partitioning which embeds treestructured regression models into a well defined theory of conditional inference procedures. Stopping criteria based on multiple test procedures are implemented and it is shown that the predictive performance of the resulting trees is as good
Remarks on the unified model of elementary particles”, Prog
 870; B. PONTECORVO: “Neutrino Experiments and the Problem of Conservation of Leptonic Charge”, Zh. Eksp. Teor. Fiz. 53 (1967) 1717 [Sov. Phys. JETP 26
, 1962
"... A particle mixture theory of neutrino is proposed. assuming the existence of two kinds of neutrinos. Based on the neutrinomixture theory, a possible unified model of elementary particles is constructed by generalizing the SakataNagoya model.*> Our scheme gives a natural explanation of smallness ..."
Abstract

Cited by 144 (0 self)
 Add to MetaCart
A particle mixture theory of neutrino is proposed. assuming the existence of two kinds of neutrinos. Based on the neutrinomixture theory, a possible unified model of elementary particles is constructed by generalizing the SakataNagoya model.*> Our scheme gives a natural explanation
Induction of Recursive Program Schemes
 In Proceedings of the 10th European Conference on Machine Learning (ECML98
, 1998
"... . In this paper we present an approach to the induction of recursive structures from examples which is based on the notion of recursive program schemes. We separate induction from examples in two stages: (1) constructing initial programs from examples and (2) folding initial programs to recursiv ..."
Abstract

Cited by 20 (17 self)
 Add to MetaCart
. In this paper we present an approach to the induction of recursive structures from examples which is based on the notion of recursive program schemes. We separate induction from examples in two stages: (1) constructing initial programs from examples and (2) folding initial programs
A Unified Theory Of Interconnection Network Structure
 Theoretical Computer Science
, 1986
"... The relationship between the topology of interconnection networks and their functional properties is examined. Graph theoretical characterizations are derived for delta networks, which have a simple routing scheme, and for bidelta networks, which have the delta property in both directions. Delta net ..."
Abstract

Cited by 48 (0 self)
 Add to MetaCart
networks are shown to have a recursive structure. Bidelta networks are shown to have a unique topology. The definition of bidelta network is used to derive in a uniform manner the labeling schemes that define the omega networks, indirect binary cube networks, flip networks, baseline networks, modified data
Results 1  10
of
1,060