4085 search results - page 366 / 817 » Data Services - From Data to Containers |
184
click to vote
IFIP
2004
Springer
16 years 3 days ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
192
click to vote
ADC
2003
Springer
15 years 12 months ago
2003
Springer
Selectivity estimation of queries not only provides useful information to the query processing optimization but also may give users a preview of processing results. In this paper,...
162
click to vote
IWPC
1999
IEEE
15 years 11 months ago
1999
IEEE
In a typical COBOL program, the data division consists of 50% of the lines of code. Automatic type inference can help to understand the large collections of variable declarations ...
160
click to vote
STOC
1996
ACM
15 years 11 months ago
1996
ACM
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...
214
click to vote
AMDO
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we describe a recognition approach based on the notion of primitives. As opposed to recognizing actions based on temporal trajectories or temporal volumes, primitive-...