Sciweavers

6358 search results - page 300 / 1272
» Computing spectral sequences
Sort
View
IFL
2004
Springer
16 years 1 days ago
A Virtual Machine for Functional Logic Computations
Abstract. We describe the architecture of a virtual machine for executing functional logic programming languages. A distinguishing feature of our machine is that it preserves the o...
Sergio Antoy, Michael Hanus, Jimeng Liu, Andrew P....
142
Voted
SIGCSE
2003
ACM
125views Education» more  SIGCSE 2003»
15 years 12 months ago
Introducing middle school girls to fault tolerant computing
During summer 2002, we ran a workshop module for a group of 28 eighth-grade girls. Our aim was ambitious: to introduce these students, ages 12 and 13, to computer science by focus...
Paolo A. G. Sivilotti, Murat Demirbas
SIGGRAPH
1992
ACM
15 years 10 months ago
Computing the antipenumbra of an area light source
We define the antiumbra and the antipenumbra of a convex area light source shining through a sequence of convex areal holes in three dimensions. The antiumbra is the volume from w...
Seth J. Teller
JCB
2000
129views more  JCB 2000»
15 years 6 months ago
Prediction of RNA Base Pairing Probabilities on Massively Parallel Computers
We present an implementation of McCaskill's algorithm for computing the base pair probabilities of an RNA molecule for massively parallel message passing architectures. The p...
Martin Fekete, Ivo L. Hofacker, Peter F. Stadler
190
Voted
ESA
1998
Springer
175views Algorithms» more  ESA 1998»
15 years 11 months ago
Computing the Edit-Distance between Unrooted Ordered Trees
An ordered tree is a tree in which each node's incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The e...
Philip N. Klein