Sciweavers

2223 search results - page 299 / 445
» Ontological Framework for Approximation
Sort
View
VLSID
2002
IEEE
130views VLSI» more  VLSID 2002»
16 years 5 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
CVPR
2010
IEEE
16 years 28 days ago
Learning from Interpolated Images using Neural Networks for Digital Forensics
Interpolated images have data redundancy, and special correlation exists among neighboring pixels, which is a crucial clue in digital forensics. We design a neural network based f...
Yizhen Huang, Na Fan
CCA
2009
Springer
15 years 11 months ago
Computability of Homology for Compact Absolute Neighbourhood Retracts
In this note we discuss the information needed to compute the homology groups of a topological space. We argue that the natural class of spaces to consider are the compact absolut...
Pieter Collins
DBPL
2009
Springer
131views Database» more  DBPL 2009»
15 years 11 months ago
XML Security Views Revisited
In this paper, we revisit the view based security framework for XML without imposing any of the previously considered restrictions on the class of queries, the class of DTDs, and t...
Benoît Groz, Slawomir Staworko, Anne-C&eacut...
IFIP
2009
Springer
15 years 11 months ago
HMM-Based Trust Model
Probabilistic trust has been adopted as an approach to taking security sensitive decisions in modern global computing environments. Existing probabilistic trust frameworks either a...
Ehab ElSalamouny, Vladimiro Sassone, Mogens Nielse...