4397 search results - page 383 / 880 » Relational Algebra Operations |
157
click to vote
ACSC
2004
IEEE
15 years 10 months ago
2004
IEEE
Types are fundamental for enforcing levels of abstraction in modern high-level programming languages and their lower-level representations. However, some type-related features suc...
173
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
With the discovery of new exploit techniques, new protection mechanisms are needed as well. Mitigations like DEP (Data Execution Prevention) or ASLR (Address Space Layout Randomiz...
145
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
The rules of "Bulgarian solitaire" are considered as an operation on the set of partitions to induce a finite dynamical system. We focus on partitions with no preimage u...
182
click to vote
IANDC
2006
15 years 6 months ago
2006
It is well-known that stable models (as dI-domains, qualitative domains and coherence are not fully abstract for the language PCF. This fact is related to the existence of stable ...
179
click to vote
FSS
2007
15 years 6 months ago
2007
Formal concept analysis and rough set theory are two important tools in knowledge representation and knowledge discovery in relational information systems. The purpose of this pap...