Sciweavers

5084 search results - page 706 / 1017
» Proving Possibility Properties
Sort
View
TOPLAS
1998
133views more  TOPLAS 1998»
15 years 6 months ago
A Systematic Study of Functional Language Implementations
Abstract: We introduce a unified framework to describe, relate, compare and classify functional language implementations. The compilation process is expressed as a succession of p...
Rémi Douence, Pascal Fradet
ENTCS
2007
150views more  ENTCS 2007»
15 years 6 months ago
On the Expressiveness of Mobile Synchronizing Petri Nets
In recent papers we have introduced Mobile Synchronizing Petri Nets, a new model for mobility based on coloured Petri Nets. It allows the description of systems composed of a coll...
Fernando Rosa Velardo, David de Frutos-Escrig, Olg...
PR
2007
96views more  PR 2007»
15 years 6 months ago
Style-preserving English handwriting synthesis
This paper presents a novel and effective approach to synthesize English handwriting in the user’s writing style. We select the most important features that depict the handwriti...
Zhouchen Lin, Liang Wan
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 5 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase
CORR
2008
Springer
117views Education» more  CORR 2008»
15 years 5 months ago
Complexity of Decoding Positive-Rate Reed-Solomon Codes
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
Qi Cheng, Daqing Wan