Sciweavers

604 search results - page 115 / 121
» Representing Information Need with Semantic Relations
Sort
View
PPOPP
2012
ACM
12 years 2 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
CODES
2005
IEEE
14 years 1 months ago
Enhancing security through hardware-assisted run-time validation of program data properties
The growing number of information security breaches in electronic and computing systems calls for new design paradigms that consider security as a primary design objective. This i...
Divya Arora, Anand Raghunathan, Srivaths Ravi, Nir...
DAWAK
2004
Springer
14 years 23 days ago
Conceptual Design of XML Document Warehouses
EXtensible Markup Language (XML) has emerged as the dominant standard in describing and exchanging data among heterogeneous data sources. XML with its self-describing hierarchical ...
Vicky Nassis, Rajagopal Rajugan, Tharam S. Dillon,...
PSSE
2004
Springer
14 years 22 days ago
Developing and Reasoning About Probabilistic Programs in pGCL
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...
Annabelle McIver, Carroll Morgan
SEMWEB
2007
Springer
14 years 1 months ago
Lightweight Community-Driven Ontology Evolution
Only few well-maintained domain ontologies can be found on the Web. The likely reasons for the lack of useful domain ontologies include that (1) informal means to convey intended m...
Katharina Siorpaes