peer-reviewed-work.bib

@comment{{This file has been generated by bib2bib 1.92}}
@comment{{Command line: bib2bib -ob peer-reviewed-work.bib -oc /dev/null -c 'type : "peer-reviewed-workshop"' publications.bib}}
@inproceedings{heeringa-oates:aaaifs2001,
  type = {peer-reviewed-workshop},
  author = {Brent Heeringa and Tim Oates},
  title = {\url{./aaai-fs2001.pdf}{Two Algorithms for Learning the Parameters 
           of Stochastic Context-Free Grammars}},
  booktitle = {Working Notes of the 2001 AAAI Fall Symposium 
               on Using Uncertainty within Computation},
  pages = {58--62},
  year = {2001},
  abstract = {Stochastic context-free grammars (SCFGs) are often used
to represent the syntax of natural languages.  Most algorithms for
learning them require storage and repeated processing of a sentence
corpus.  The memory and computational demands of such algorithms are
ill-suited for embedded agents such as a mobile robot.  Two algorithms
are presented that incrementally learn the parameters of stochastic
context-free grammars as sentences are observed.  Both algorithms
require a fixed amount of space regardless of the number of sentence
observations.  Despite using less information than the inside-outside
algorithm, the algorithms perform almost as well.},
  notes = {Another version of this paper is available as \url{./01-21.pdf}{University of Massachusetts Technical Report 01-21}}
}
@inproceedings{heeringa-lewandowski:sccs1998,
  type = {peer-reviewed-workshop},
  author = {Brent Heeringa and Scott Lewandowski},
  title = {\url{./sccs1998.pdf}{A Study of Techniques for Introducing 
          Concurrency into Library Routines of Modern Functional 
          Programming Languages}},
  booktitle = {Proceedings of the Thirty-First Annual Small \
               College Computing Symposium},
  year = {1998},
  notes = {Winner of the Best Student Paper award.},
  pages = {141--152},
  abstract = {Erlang is a modern functional programming language with
additional features that support explicit concurrency through
lightweight processes and message passing.  Erlang's clean
semantics and lack of side effects make it possible to develop high
quality software that can easily take advantage of the availability of
multiple processors.  Like most functional programming languages,
Erlang provides a number of library routines (e.g. map) for processing
and manipulating lists.  These routines are an excellent target for
the introduction of concurrent processing techniques.  In this work we
explore various methods for introducing concurrency into list
processing routines such as map.  We report on the results of our
experiments using the Erlang Development Environment, and discuss
which approaches to concurrency are most beneficial given the number
of processing nodes available and the properties of the computation
(e.g. type of function being applied, size of the input list, etc.).}
}