191 search results - page 26 / 39 » Extending the Relational Algebra to Support Transaction Time |
COCOON
1999
Springer
15 years 1 months ago
1999
Springer
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
108
click to vote
TCS
2011
14 years 4 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
101
click to vote
ER
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Collections play an important part in everyday life. Therefore, conceptual data models should support collection types to make data modeling as natural as possible for it...
SAC
2004
ACM
15 years 3 months ago
2004
ACM
Being E-commerce one of the most critical Internet application, it is fundamental to employ technologies which guarantee not only secure transactions but also an adequate quality ...
AI
2008
Springer
14 years 9 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...