Sciweavers

21 search results - page 4 / 5
» On Finite-time Computability Preserving Conversions
Sort
View
COLING
2000
13 years 7 months ago
A Model of Competence for Corpus-Based Machine Translation
A translation is a conversion from a source language into a target language preserving the meaning. A huge number of techniques and computational approaches have been experimented...
Michael Carl
CONCUR
2008
Springer
13 years 7 months ago
Abstraction for Stochastic Systems by Erlang's Method of Stages
ion for Stochastic Systems by Erlang's Method of Stages Joost-Pieter Katoen1 , Daniel Klink1 , Martin Leucker2 , and Verena Wolf3 1 RWTH Aachen University 2 TU Munich 3 EPF La...
Joost-Pieter Katoen, Daniel Klink, Martin Leucker,...
POPL
2010
ACM
14 years 3 months ago
Dependent types and program equivalence
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
Jianzhou Zhao, Limin Jia, Stephanie Weirich, Vilhe...
EUROGRAPHICS
2010
Eurographics
13 years 6 months ago
Contrast-aware Halftoning
This paper proposes two variants of a simple but efficient algorithm for structure-preserving halftoning. Our algorithm extends Floyd-Steinberg error diffusion; the goal of our ex...
Hua Li and David Mould
BMCBI
2002
131views more  BMCBI 2002»
13 years 5 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida