Filters








6,576 Hits in 4.2 sec

Context-Inclusive Approach to Speed-up Function Evaluation for Statistical Queries : An Extended Abstract

Vijay Gandhi, James Kang, Shashi Shekhar, Junchang Ju, Eric Kolaczyk, Sucharita Gopal
2006 Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)  
Such a problem is computationally challenging due to the significant computation cost to evaluate the quality estimation function for each candidate model.  ...  A recently proposed method of multiscale, multigranular classification has high computational overhead of function evaluation for various candidate models independently before comparison.  ...  We are grateful to Kim Koffolt for improving the readability of this paper.  ... 
doi:10.1109/icdmw.2006.52 dblp:conf/icdm/GandhiKSJKG06 fatcat:k334ipnbhrc4rowftkhyrpczcq

Typer inference builds a short cut to deforestation

Olaf Chitil
1999 SIGPLAN notices  
In return, short cut deforestation expects both producer and consumer of the intermediate structure in a certain form. Warm fusion was proposed to automatically transform functions into this form.  ...  Typability for the second-order typed λ-calculus is undecidable.  ...  Acknowledgements I thank Frank Huch and Simon Peyton Jones for fruitful discussions and many suggestions for improving this paper.  ... 
doi:10.1145/317765.317907 fatcat:a32q4fdilna4pm3pq7k3fu5yiq

Typer inference builds a short cut to deforestation

Olaf Chitil
1999 Proceedings of the fourth ACM SIGPLAN international conference on Functional programming - ICFP '99  
In return, short cut deforestation expects both producer and consumer of the intermediate structure in a certain form. Warm fusion was proposed to automatically transform functions into this form.  ...  Typability for the second-order typed λ-calculus is undecidable.  ...  Acknowledgements I thank Frank Huch and Simon Peyton Jones for fruitful discussions and many suggestions for improving this paper.  ... 
doi:10.1145/317636.317907 dblp:conf/icfp/Chitil99 fatcat:eivgizkfs5ei3cifvfbvnowqhm

On Deforesting Parameters of Accumulating Maps [chapter]

Kazuhiko Kakehi, Robert Glück, Yoshihiko Futamura
2002 Lecture Notes in Computer Science  
This is due to the restriction to map-style list producers and consumers. In fact, the laws for dmap exhibit some interesting combinatorics.  ...  For this, we introduce a new function dmap, a symmetric extension of the familiar function map, and study the composition of list producers and consumers defined in terms of dmap.  ...  Acknowledgments The authors would like to thank Alberto Pettorossi and the anonymous reviewers for providing many helpful and detailed comments.  ... 
doi:10.1007/3-540-45607-4_3 fatcat:zebplxbc3ja5hkyibgjynp7tue

Concatenate, reverse and map vanish for free

Janis Voigtländer
2002 SIGPLAN notices  
The general idea is to uniformly abstract from data constructors and manipulating operations by means of rank-2 polymorphic combinators that exploit algebraic properties of these operations to provide  ...  Chitil [6] reduced the problem of list abstraction for shortcut deforestation to a decidable partial type inference problem.  ...  Extend D to a new data type D with additional constructors for the manipulating operations f 1 , . . . , f n and express Dproducers as builds for this extended data type D , freezing f 1 , . . . , f n  ... 
doi:10.1145/583852.581481 fatcat:4edosbwk5jakjbn6i4sgqlcavq

Concatenate, reverse and map vanish for free

Janis Voigtländer
2002 Proceedings of the seventh ACM SIGPLAN international conference on Functional programming - ICFP '02  
The general idea is to uniformly abstract from data constructors and manipulating operations by means of rank-2 polymorphic combinators that exploit algebraic properties of these operations to provide  ...  Chitil [6] reduced the problem of list abstraction for shortcut deforestation to a decidable partial type inference problem.  ...  Extend D to a new data type D with additional constructors for the manipulating operations f 1 , . . . , f n and express Dproducers as builds for this extended data type D , freezing f 1 , . . . , f n  ... 
doi:10.1145/581478.581481 dblp:conf/icfp/Voigtlander02 fatcat:bonrb2eezzgilaq75b3iqh62by

Higher order deforestation [chapter]

G. W. Hamilton
1996 Lecture Notes in Computer Science  
In previous work, we have shown how the deforestation algorithm can be extended to handle higher order programs.  ...  We argue that, because our extended algorithm uses an easy to recognise treeless form, there is more transparency for the programmer in terms of the improvements which will be made.  ...  Figure 8 . 8 Extended Unfolding Rule for Higher Order Deforestation Example 4. 1 . 1 The result of transforming the program inFig. 5is as follows.  ... 
doi:10.1007/3-540-61756-6_87 fatcat:woreicyd4bgphdhe34r7jsitny

Fusion in Practice [chapter]

Diederik van Arkel, John van Groningen, Sjaak Smetsers
2003 Lecture Notes in Computer Science  
The extended fusion algorithm is able to deal with standard deforestation but also with higher-order removal and dictionary elimination. We have implemented this method in the Clean 2.0 compiler.  ...  A more sophisticated technique, called fusion, tries to achieve the same goal but with better results.  ...  These improvements were almost entirely caused by better optimization of a few modules that use a monadic style, and not by removal of intermediate data structures using deforestation.  ... 
doi:10.1007/3-540-44854-3_4 fatcat:tzucajh3djfmpjtpjp5mi26abi

Positive supercompilation for a higher order call-by-value language

Peter A. Jonsson, Johan Nordlander
2009 SIGPLAN notices  
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs.  ...  This algorithm utilizes strictness information for deciding whether to substitute or not and compares favorably with previous call-by-name transformations.  ...  We would also like to thank Viktor Leijon and the anonymous referees for providing useful comments that helped improve the presentation and contents and Germán Vidal for explaining narrowing to us.  ... 
doi:10.1145/1594834.1480916 fatcat:2pmwnklnyncgzkg2l3jczz3ngm

Positive supercompilation for a higher order call-by-value language

Peter A. Jonsson, Johan Nordlander
2008 Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '09  
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs.  ...  This algorithm utilizes strictness information for deciding whether to substitute or not and compares favorably with previous call-by-name transformations.  ...  We would also like to thank Viktor Leijon and the anonymous referees for providing useful comments that helped improve the presentation and contents and Germán Vidal for explaining narrowing to us.  ... 
doi:10.1145/1480881.1480916 dblp:conf/popl/JonssonN09 fatcat:qvkwsgedozhufpcqdzqtob5qme

Saving the tropical forest: needs and prognosis

1994 Biological Conservation  
Whilst there is scope for further research, many problems can be overcome through increased community participation, better communication, more effective management and the implementation of a few simple  ...  Many attempts to reverse deforestation in the tropics have failed because they addressed symptoms rather than causes.  ...  Those with security have the choice -and children in the developed world consume ten times the resources of those in developing countries. Instead of big families, we must have extended families.  ... 
doi:10.1016/0006-3207(94)90574-6 fatcat:gn7k4ehlz5eirdtnoshzskvnyq

Making deforestation risk visible. Discourses on bovine leather supply chain in Brazil

Aynur Mammadova, Jelle Behagel, Mauro Masiero
2020 Geoforum  
Article 25fa states that the author of a short scientific work funded either wholly or partially by Dutch public funds is entitled to make that work publicly available for no consideration following a  ...  Acknowledgement We would like to thank the European Forest Institute for their financial support through Short Scientific Visits (SSV) call for Early Stage Researchers.  ...  A consumer who does not know where his/her burger is produced is not able to withhold consent for deforestation.  ... 
doi:10.1016/j.geoforum.2020.03.008 fatcat:bkokaral3feb7c2za2pxnwwrui

Eighty-six EU policy options for reducing imported deforestation

Simon L. Bager, U. Martin Persson, Tiago N.P. dos Reis
2021 One Earth  
Graphical Abstract Highlights d From 1,141 proposals, we identify 86 EU policy options for reducing deforestation d We assess the political feasibility to identify policy barriers d Many policy options  ...  lack a proven theory of change for reducing deforestation d We identify a trade-off between political feasibility and potential policy impact  ...  Gradually extending regulations to other FRCs and regions over time, a process known as ''policy sequencing,'' 117 and coordinating efforts with other consumer countries procuring large quantities of FRCs  ... 
doi:10.1016/j.oneear.2021.01.011 fatcat:vs7dedtjqzdgfjd77sce5ry4b4

Sustainable Energy Model for the production of biomass briquettes based on rice husk in low-income agricultural areas in Peru

Juan Arévalo, Grimaldo Quispe, Carlos Raymundo
2017 Energy Procedia  
Abstract The proposed Sustainable Energy Model is based on rice husk and the development of briquettes made from agricultural waste, which will increase efficiency in the domestic sector, and potentially  ...  with 4,040 kcal / kg of heat power and 80.39% combustion efficiency, allowing the little use of biofuel compared to firewood, and consequently, the utilization of this biofuel would reduce levels of deforestation  ...  Acknowledgements Gratitude is extended to the technical and administrative personnel of the laboratory of the Peruvian University of Applied Sciences, for the support provided in the availability of materials  ... 
doi:10.1016/j.egypro.2017.11.026 fatcat:a5bml3fxejf7dm4snl7o5ndpbi

Multiple Intermediate Structure Deforestation by Shortcut Fusion [chapter]

Alberto Pardo, João Paulo Fernandes, João Saraiva
2013 Lecture Notes in Computer Science  
The techniques proposed so far, however, only consider programs defined as the composition of a single producer with a single consumer.  ...  Shortcut fusion is a well-known optimization technique for functional programs.  ...  Based on this extended form of build an extended shortcut fusion law can be formulated (see [15] for a proof): Law 2 (extended fold/build) For strictness-preserving 4 N , map N (fold (nil , cons)) •  ... 
doi:10.1007/978-3-642-40922-6_9 fatcat:sz7lxtd2sbflxjyf2nh3wphc5a
« Previous Showing results 1 — 15 out of 6,576 results