Sciweavers

2475 search results - page 299 / 495
» On the accuracy of language trees
Sort
View
ICFP
2005
ACM
14 years 8 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
ICFP
2005
ACM
14 years 8 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
ECOOP
2000
Springer
14 years 16 days ago
Copying and Comparing: Problems and Solutions
In object oriented programming, it is sometimes necessary to copy objects and to compare them for equality or inequality. We discuss some of the issues involved in copying and comp...
Peter Grogono, Markku Sakkinen
CICLING
2009
Springer
14 years 8 months ago
Improved Unsupervised Name Discrimination with Very Wide Bigrams and Automatic Cluster Stopping
We cast name discrimination as a problem in clustering short contexts. Each occurrence of an ambiguous name is treated independently, and represented using second?order context vec...
Ted Pedersen
ASPLOS
2009
ACM
14 years 3 months ago
Performance analysis of accelerated image registration using GPGPU
This paper presents a performance analysis of an accelerated 2-D rigid image registration implementation that employs the Compute Unified Device Architecture (CUDA) programming e...
Peter Bui, Jay B. Brockman