Sciweavers

156 search results - page 6 / 32
» On the notion of uniqueness
Sort
View
ER
2001
Springer
128views Database» more  ER 2001»
13 years 12 months ago
Pockets of Flexibility in Workflow Specification
: Workflow technology is currently being deployed in quite diverse domains. However, the element of change is present in some degree and form in almost all domains. A workflow impl...
Shazia W. Sadiq, Wasim Sadiq, Maria E. Orlowska
FUZZIEEE
2007
IEEE
14 years 1 months ago
Possibilistic information fusion using maximal coherent subsets
— When multiple sources provide information about the same unknown quantity, their fusion into a synthetic interpretable message is often a tedious problem, especially when sourc...
Sébastien Destercke, Didier Dubois, Eric Ch...
ACL
2001
13 years 8 months ago
Parse Forest Computation of Expected Governors
In a headed tree, each terminal word can be uniquely labeled with a governing word and grammatical relation. This labeling is a summary of a syntactic analysis which eliminates de...
Helmut Schmid, Mats Rooth
MLQ
2002
95views more  MLQ 2002»
13 years 7 months ago
Invariant Logics
A modal logic is called invariant if for all automorphisms of NExt K, () = . An invariant logic is therefore uniquely determined by its surrounding in the lattice. It will be est...
Marcus Kracht
IPL
2010
69views more  IPL 2010»
13 years 5 months ago
A simple representation of subwords of the Fibonacci word
We introduce a representation of subwords of the infinite Fibonacci word f∞ by a specific concatenation of finite Fibonacci words. It is unique and easily computable by backwa...
Bartosz Walczak