Sciweavers

2944 search results - page 502 / 589
» On Well Quasi-orders on Languages
Sort
View
IJCM
2010
80views more  IJCM 2010»
13 years 8 months ago
On implementing recognizable transductions
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
Stavros Konstantinidis, Nicolae Santean, S. Yu
JAIR
2010
131views more  JAIR 2010»
13 years 8 months ago
Automatic Induction of Bellman-Error Features for Probabilistic Planning
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
Jia-Hong Wu, Robert Givan
JOT
2010
117views more  JOT 2010»
13 years 8 months ago
Formal Model and DSL for Separation of Concerns based on Views
The separation of concerns (SOC), as a conceptual tool, enables us to manage the complexity of software systems that we develop. The benefits of this paradigm, such as reuse, enhan...
Mehdi Adda, Hamid Mcheick, Hafedh Mili
MT
2010
110views more  MT 2010»
13 years 8 months ago
Metrics for MT evaluation: evaluating reordering
Translating between dissimilar languages requires an account of the use of divergent word orders when expressing the same semantic content. Reordering poses a serious problem for s...
Alexandra Birch, Miles Osborne, Phil Blunsom
PC
2010
177views Management» more  PC 2010»
13 years 8 months ago
Parallel graph component labelling with GPUs and CUDA
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne