Sciweavers

1143 search results - page 125 / 229
» Mental models of recursion
Sort
View
APAL
2008
104views more  APAL 2008»
13 years 9 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
TNN
1998
123views more  TNN 1998»
13 years 8 months ago
A general framework for adaptive processing of data structures
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
Paolo Frasconi, Marco Gori, Alessandro Sperduti
HPCA
2003
IEEE
14 years 9 months ago
A Methodology for Designing Efficient On-Chip Interconnects on Well-Behaved Communication Patterns
As the level of chip integration continues to advance at a fast pace, the desire for efficient interconnects-whether on-chip or off-chip--is rapidly increasing. Traditional interc...
Wai Hong Ho, Timothy Mark Pinkston
POPL
2006
ACM
14 years 9 months ago
Adventures in time and space
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
Norman Danner, James S. Royer
SAC
2009
ACM
14 years 3 months ago
Online annotation and prediction for regime switching data streams
Regime switching models, in which the state of the world is locally stationary, are a useful abstraction for many continuous valued data streams. In this paper we develop an onlin...
Gordon J. Ross, Dimitris K. Tasoulis, Niall M. Ada...