3319 search results - page 220 / 664 » Type Theoretical Databases |
MFCS
2005
Springer
15 years 4 months ago
2005
Springer
A partial information algorithm for a language A computes, for some fixed m, for input words x1, . . . , xm a set of bitstrings containing χA(x1, . . . , xm). E.g., p-selective, ...
TAPSOFT
1997
Springer
15 years 3 months ago
1997
Springer
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...
115
Voted
AGI
2011
14 years 2 months ago
2011
What set of concepts and formalizations might one use to make a practically useful, theoretically rigorous theory of generally intelligent systems? We present a novel perspective m...
86
Voted
IPM
2007
14 years 10 months ago
2007
We describe a compression model for semistructured documents, called Structural Contexts Model (SCM), which takes advantage of the context information usually implicit in the stru...
192
Voted
ICDE
2006
IEEE
16 years 8 days ago
2006
IEEE
Scheduling/prioritization of DBMS transactions is important for many applications that rely on database backends. A convenient way to achieve scheduling is to limit the number of ...