Sciweavers

2841 search results - page 26 / 569
» A Call to Order
Sort
View
RTCSA
1999
IEEE
15 years 2 months ago
Dynamic Adjustment of Serialization Order Using Timestamp Intervals in Real-Time Databases
Although an optimistic approach has been shown to be better than locking protocols for real-time database systems (RTDBS), it has the problems of unnecessary restarts and heavy re...
Jan Lindström, Kimmo E. E. Raatikainen
TEI
2010
ACM
131views Hardware» more  TEI 2010»
15 years 4 months ago
SOPHYA: a system for digital management of ordered physical document collections
In recent years several systems have been developed to integrate the management of physical and digital documents and artefacts. These systems, which often rely on technologies su...
Matthew Jervis, Masood Masoodian
CORR
2006
Springer
114views Education» more  CORR 2006»
14 years 9 months ago
A New Cryptosystem Based On Hidden Order Groups
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
Amitabh Saxena, Ben Soh
DKE
2006
109views more  DKE 2006»
14 years 9 months ago
Xandy: A scalable change detection technique for ordered XML documents using relational databases
Previous work in change detection to XML documents is not suitable for detecting the changes to large XML documents as it requires a lot of memory to keep the two versions of XML ...
Erwin Leonardi, Sourav S. Bhowmick
ENDM
2007
74views more  ENDM 2007»
14 years 9 months ago
The order of the largest complete minor in a random graph
Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let Gn,p denote a random graph on n vertices with edge probab...
Nikolaos Fountoulakis, Daniela Kühn, Deryk Os...