Sciweavers

1573 search results - page 80 / 315
» Signs and Formal Concepts
Sort
View
SEMWEB
2004
Springer
14 years 3 months ago
Semantic Web Publishing using Named Graphs
The Semantic Web consists of many RDF graphs nameable by URIs. This paper extends the syntax and semantics of RDF to cover such Named Graphs. This enables RDF statements that descr...
Jeremy J. Carroll, Christian Bizer, Patrick J. Hay...
CC
2004
Springer
134views System Software» more  CC 2004»
14 years 1 months ago
Widening Integer Arithmetic
Abstract. Some codes require computations to use fewer bits of precision than are normal for the target machine. For example, Java requires 32-bit arithmetic even on a 64-bit targe...
Kevin Redwine, Norman Ramsey
IJCAI
2001
13 years 11 months ago
Context-specific Sign-propagation in Qualitative Probabilistic Networks
ive probabilistic networks are qualitative abstractions of probabilistic networks, summarising probabilistic influences by qualitative signs. As qualitative networks model influen...
Silja Renooij, Simon Parsons, Linda C. van der Gaa...
IJISEC
2010
87views more  IJISEC 2010»
13 years 8 months ago
How to construct identity-based signatures without the key escrow problem
The inherent key escrow problem is one of the main reasons for the slow adoption of identity-based cryptography. The existing solution for mitigating the key escrow problem is by a...
Tsz Hon Yuen, Willy Susilo, Yi Mu
MEMOCODE
2008
IEEE
14 years 4 months ago
Virtual prototyping AADL architectures in a polychronous model of computation
While synchrony and asynchrony are two distinct concepts of concurrency theory, effective and formally defined embedded system design methodologies usually mix the best from both...
Ma Yue, Jean-Pierre Talpin, Thierry Gautier