1537 search results - page 77 / 308 » On sets not belonging to algebras |
CCA
2009
Springer
14 years 3 months ago
2009
Springer
We consider the uniform BSS model of computation where the machines can perform additions, multiplications, and tests of the form x ≥ 0. The oracle machines can also check whethe...
FSKD
2009
Springer
13 years 6 months ago
2009
Springer
Sense Induction is the process of identifying the word sense given its context, often treated as a clustering task. This paper explores the use of spectral cluster method which in...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
AML
2006
13 years 9 months ago
2006
Lukasiewicz's infinite-valued logic is commonly defined as the set of formulas that take the value 1 under all evaluations in the Lukasiewicz algebra on the unit real interva...
DBPL
1991
Springer
14 years 15 days ago
1991
Springer
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...