1117 search results - page 23 / 224 » Equivalent Representations of Set Functions |
WADS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
EJC
2010
14 years 9 months ago
2010
Each clone C on a fixed base set A determines a quasiorder on the set of all operations on A by the following rule: f is a C-minor of g if f can be obtained by substituting operati...
76
Voted
NAACL
2003
2003
Syntax-based Alignment of Multiple Translations: Extracting Paraphrases and Generating New Sentences
14 years 11 months ago
We describe a syntax-based algorithm that automatically builds Finite State Automata (word lattices) from semantically equivalent translation sets. These FSAs are good representat...
JELIA
2004
Springer
15 years 2 months ago
2004
Springer
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
CGF
2008
14 years 9 months ago
2008
Typically, flow volumes are visualized by defining their boundary as iso-surface of a level set function. Grid-based level sets offer a good global representation but suffer from ...