Sciweavers

2494 search results - page 6 / 499
» Dependable Distributed Computing Using Free Databases
Sort
View
CONCUR
2009
Springer
14 years 2 months ago
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...
DRM
2004
Springer
14 years 27 days ago
Tamper detection and localization for categorical data using fragile watermarks
Today, database relations are widely used and distributed over the Internet. Since these data can be easily tampered with, it is critical to ensure the integrity of these data. In...
Yingjiu Li, Huiping Guo, Sushil Jajodia
TKDE
1998
116views more  TKDE 1998»
13 years 7 months ago
Dependability and Performance Measures for the Database Practitioner
-- We estimate the availability, reliability, and mean transaction time (response time) for repairable database configurations, centralized or distributed, in which each service co...
Toby J. Teorey, Wee Teck Ng
DOCENG
2005
ACM
13 years 9 months ago
An environment for maintaining computation dependency in XML documents
In the domain of XML authoring, there have been many tools to help users to edit XML documents. These tools make it easier to produce complex documents by using such technologies ...
Dongxi Liu, Zhenjiang Hu, Masato Takeichi
WMCSA
2003
IEEE
14 years 23 days ago
River: An Infrastructure for Context Dependent, Reactive Communication Primitives
Applications and services in ubiquitous computing systems often interact in a context-dependent, reactive manner. How information flows, and what services communicate when, is det...
Jong Hee Kang, Matthai Philipose, Gaetano Borriell...