Sciweavers

2413 search results - page 108 / 483
» Models for universal usability
Sort
View
96
Voted
COLING
2008
15 years 2 months ago
Hindi Urdu Machine Transliteration using Finite-State Transducers
Finite-state Transducers (FST) can be very efficient to implement inter-dialectal transliteration. We illustrate this on the Hindi and Urdu language pair. FSTs can also be used fo...
M. G. Abbas Malik, Christian Boitet, Pushpak Bhatt...
DT
2006
113views more  DT 2006»
15 years 21 days ago
The Challenges of Synthesizing Hardware from C-Like Languages
at their abstractions are similar to data types and operations supplied by conventional processors. A core principle of BCPL is its memory model: an The Challenges of Synthesizing ...
Stephen A. Edwards
73
Voted
JSYML
1998
51views more  JSYML 1998»
15 years 10 days ago
Compactness of Loeb Spaces
In this paper we show that the compactness of a Loeb space depends on its cardinality, the nonstandard universe it belongs to and the underlying model of set theory we live in. In...
Renling Jin, Saharon Shelah
97
Voted
SIAMCOMP
2010
96views more  SIAMCOMP 2010»
14 years 7 months ago
Quantified Equality Constraints
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...
Manuel Bodirsky, Hubie Chen
124
Voted
AGI
2011
14 years 4 months ago
An Information Theoretic Representation of Agent Dynamics as Set Intersections
We represent agents as sets of strings. Each string encodes a potential interaction with another agent or environment. We represent the total set of dynamics between two agents as ...
Samuel Epstein, Margrit Betke