Sciweavers

5055 search results - page 16 / 1011
» Relative Timing
Sort
View
DEXAW
2007
IEEE
141views Database» more  DEXAW 2007»
14 years 2 months ago
SWARD: Semantic Web Abridged Relational Databases
The semantic web represents meta-data as a relation of triples using the RDF data model. We have developed a virtual repository system that enables to process queries to RDF views...
Johan Petrini, Tore Risch
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 8 months ago
A Logical Temporal Relational Data Model
Time is one of the most difficult aspects to handle in real world applications such as database systems. Relational database management systems proposed by Codd offer very little ...
Nadeem Mahmood, Aqil Burney, Kamran Ahsan
CSL
2002
Springer
13 years 8 months ago
On the Automatizability of Resolution and Related Propositional Proof Systems
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
Albert Atserias, Maria Luisa Bonet
INFOCOM
2009
IEEE
14 years 3 months ago
Time Valid One-Time Signature for Time-Critical Multicast Data Authentication
Abstract—It is challenging to provide authentication to timecritical multicast data, where low end-to-end delay is of crucial importance. Consequently, it requires not only effi...
Qiyan Wang, Himanshu Khurana, Ying Huang, Klara Na...
VLSID
2002
IEEE
130views VLSI» more  VLSID 2002»
14 years 8 months ago
Using Randomized Rounding to Satisfy Timing Constraints of Real-Time Preemptive Tasks
In preemptive real-time systems, a tighter estimate of the Worst Case Response Time(WCRT) of the tasks can be obtained if the layout of the tasks in memory is included in the esti...
Anupam Datta, Sidharth Choudhury, Anupam Basu